//TESH.scrollpos=0
//TESH.alwaysfold=0
/*
This is a round-robin tournament pairs generator.
A round robin tournament is a tournament where each player plays each player exactly once.
The number of rounds in always ((number of players) - 1).
the number of pairs per round is always ((number of players) /2)
So for 12 players there will be 66 unique pairs spread across 11 rounds.
for 24 players there will be 276 unique pairs spread across 23 rounds.
And anything inbetween.
If the number of players is odd, a dummy player 0 will be added.
You have to check if a player is 0 or not playing to announce that for that player's opponent, he gets a free win.
The minimum players have be 3 for thhis code to work.
This code counts all playing players. You can choose to include computer players in the counting/pairing.
Tis code does not indlude counting the outcome of each battle, as you can do that yourself.
*/
Name | Type | is_array | initial_value |
Debug_FT_Positions | location | Yes | |
i | integer | No | |
LastElement | integer | No | |
Offset | integer | No | |
RRG_Clockwise | boolean | No | |
RRG_CurrentRound | integer | No | |
RRG_Difference | integer | No | |
RRG_EndIndex | integer | No | |
RRG_FirstElement | integer | No | |
RRG_IncludeComputers | boolean | No | |
RRG_InitialShift_Clockwise | boolean | No | |
RRG_InitialShift_Times | integer | No | |
RRG_Left | integer | No | |
RRG_MaxRounds | integer | No | |
RRG_PairCounter | integer | No | |
RRG_PairsPer_Round | integer | No | |
RRG_Player1 | integer | No | |
RRG_Player2 | integer | No | |
RRG_PlayersArray | integer | Yes | |
RRG_PlayingPlayers | force | No | |
RRG_Right | integer | No | |
RRG_StartIndex | integer | No | |
RRG_StartShiftIndex | integer | No | |
RRG_TempValue | integer | No | |
RRG_Tournament | hashtable | No | |
TestString | string | No | |
Tournament_Schedule | string | No |