kdoroschak
commented
7 years ago Calculating the maximum # of questions
This is based on player age and the pool of possible questions.
@jtwedt @dlundquist Here's a TL;DR of what I wrote up on the plane:
Let n = #/ players m = max #/rounds p_1...p_i...p_n are the players in ascending order of age (i.e. p_1 is youngest) q_1...q_i...q_n are the numbers of questions available for the i-th player.
Bounds on possible m: q_1/n <= m <= q_1
We can find the maximum # of questions: m = min (q_1/1, q_2/2, ..., q_i/i, ... q_n/n)
Choosing q's for each person
- Randomly choose m questions from p_1 (the youngest player)'s pool
- Remove those questions from the other players' possible pools
- Continue for p_2...p_n until the oldest player p_n has their questions determined
Suggestion from Rachel: don't "waste" young questions on older players