Tournament table
The calculator performs the participant placement with two following conditions: 1) Each participant must start from each starting position. 2) Each participant must encounter every other participant.
This page exists due to the efforts of the following people:
 | Timur
|
khajit_94
|
This content is licensed under Creative Commons Attribution/Share-Alike License 3.0 (Unported). That means you may freely redistribute or modify this content under the same license conditions and must attribute the original author by placing a hyperlink from your site to this work https://planetcalc.com/4511/. Also, please do not modify any references to the original work (if any) contained in this content.
The calculator performs the participant placement with two following conditions: 1) Each participant must start from each starting position. 2) Each participant must encounter every other participant.
Note: The result may not be optimal because "greedy algorithm" is used. In general, optimal results in such problems is computationally difficult because we are dealing with combinatorics and the tasks of a similar type, such as "schoolgirls problem" or "social golfers problem" are NP-complete. By the way, for some special cases, the solutions are known and published.
Comments