Participant Placement Calculator
The Participant Placement Calculator generates a list of routes for participants given the number of starting positions and participants.
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.
Each participant must start from each starting position and encounter every other participant. This is a common problem in sports tournaments, where it is desirable for each player to play against every other player at least once and try all available tracks.
The calculator uses a greedy algorithm that may not provide an optimal solution. Finding optimal solutions for these types of combinatorial problems, such as the "schoolgirls problem" or "social golfers problem," is computationally challenging and falls under NP-complete problems. However, solutions for some special cases are known and published.
Comments