Below is a simple script that will simulate the results of the preliminary rounds of a debate tournament. You can either enter the number of teams or the specific teams with school, code, and relative power ranking (1 to 10). If you enter specific teams with strengths, the algorithm will do the following:
- Prevent teams from the same squad, who have hit before, or were on the same side on the previous odd round from hitting each other.
- Completely randomize rounds 1 and 2.
- The stronger team within a side constrained bracket will be paired against a weaker team within the same bracket (if possible).
- Perform pullups (middle of higher bracket to team with least opp wins in a lower bracket) and issue byes as necessary (only one per round)
- The difference in team strength indicates the liklihood that one team will beat another. If both teams have the same strength, then it is equally likely that either one will win. If a #1 hits a #2, then there is a 60% chance the #1 will win. If a #1 hits a #3, then there is a 70% chance the #1 will win. A #1 will always beat a #6.
- In the case of a pullup, the liklihood of a win is increased by 5% for every win in difference.