Single Elimination Practice Problem Answers
Her are the practice problems for the single elimination tournament scheduling problems.
Forecasting Days:
1. N=39 and the number of games that can be played each day = 7
(Answer: 8 days)
2. N=64 and the number of games that can be played each day = 10
(Answer: 9 days)
3. N=44 and the number of games that can be played each day = 5
(Answer: 11 days)
4. N=19 and the number of games that can be played each day = 4
(Answer: 6 days)
Minimum Number of Games Needed
1. N=26 and the number of days that are available = 5
(Answer: 10 games)
2. N=36 and the number of days that are available = 10
(Answer: 4 games)
3. N=60 and the number of days that are available = 12
(Answer: 6 games)
4. N=40 and the number of days that are available = 6
(Answer: 12 games)
Maximum Number of Entries
1. Number of games that can be played each day = 13 and number of days available
= 25 (Answer: 289)
2. Number of games that can be played each day = 4 and number of days available
= 10 (Answer: 36)
3. Number of games that can be played each day =12 and number of days available
= 12 (Answer: 112)
4. Number of games that can be played each day = 8 and number of day available
=5
(Answer: 24)
Hope these help!