If T (total) players sign up, the number of players per game is between M (minimum) and P (preferred) and A (advance) players advance per game, how is the tournament structured?
I found tons of forum discussions about singular cases, but no general formula, which leaves me with a load of questions.
It would be easiest, if someone could send me the formula/algorithm/code... whatever, but I guess its not available. Therefore i guess I have to ask more singular questions.
I read that the algorithm involves free advances to handle odd numbers of (remaining) participants. The main purpose of my questions is to understand with which settings i can reduce the impact/amount of free advances.
1) Do always A players advance per game or will it sometimes deviate if this would allow avoiding free advances?
2) If M=P-1, will the first round always consist of rounded_up(T/P) games, namely (P+(-T mod P)) games with P-1 players and alle other game with P players?
That would seem intuitive, as it would avoid any free advances with the maximum possible number of P player games. However, the problem may be that the algorithm would have to deal with A*rounded_up(T/P) players after that, which may be a bad number to handle. E.g. if T=32, P=5, M=4, A=2 and they would set up 4 5p games and 3 4p games they would have to deal with 14 players in round 2 and 6 players in round 3, which is uncoverable with 4p and 5p games, so it has to give free advances. Does the algorithm plan ahead and create 8 4p games, so it can perfectly make 4/2/1 4p games in round 2/3/4? Or is it just gready in each round?
3) Id expect that i could reduce free advances by widening the range between M and P (more tolerance in game size) and by increasing A (more advancers->more rounds->more margin to fit the numbers). Do you agree?
I found tons of forum discussions about singular cases, but no general formula, which leaves me with a load of questions.
It would be easiest, if someone could send me the formula/algorithm/code... whatever, but I guess its not available. Therefore i guess I have to ask more singular questions.
I read that the algorithm involves free advances to handle odd numbers of (remaining) participants. The main purpose of my questions is to understand with which settings i can reduce the impact/amount of free advances.
1) Do always A players advance per game or will it sometimes deviate if this would allow avoiding free advances?
2) If M=P-1, will the first round always consist of rounded_up(T/P) games, namely (P+(-T mod P)) games with P-1 players and alle other game with P players?
That would seem intuitive, as it would avoid any free advances with the maximum possible number of P player games. However, the problem may be that the algorithm would have to deal with A*rounded_up(T/P) players after that, which may be a bad number to handle. E.g. if T=32, P=5, M=4, A=2 and they would set up 4 5p games and 3 4p games they would have to deal with 14 players in round 2 and 6 players in round 3, which is uncoverable with 4p and 5p games, so it has to give free advances. Does the algorithm plan ahead and create 8 4p games, so it can perfectly make 4/2/1 4p games in round 2/3/4? Or is it just gready in each round?
3) Id expect that i could reduce free advances by widening the range between M and P (more tolerance in game size) and by increasing A (more advancers->more rounds->more margin to fit the numbers). Do you agree?