Timeline for Finding the larger number with a minimal number of questions
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 23, 2023 at 21:37 | comment | added | xnor | I should have said that we can treat the two lower bounds as equal since any values one player has that are below the other player's lower bound are irrelevant, but it looks like @isaacg is already doing that too. | |
| Jul 23, 2023 at 13:22 | comment | added | RobPratt | No, $\ell_b$ and $\ell_c$ are generally different. For example, if the first question is to Bob and the reply is yes, then $\ell_b=x$ and $\ell_c=1$. The new answer from @isaacg uses the other ideas you mentioned. | |
| Jul 23, 2023 at 6:39 | comment | added | xnor | Doesn't $\ell_b$ always equals $\ell_c$? I think you can also just work with $u_b - \ell_b$ and $u_c - \ell_c$ to narrow down to two variables. And, moreover it's always better to ask the question of the person whose have the largest upper bound. | |
| Jul 23, 2023 at 0:19 | history | edited | RobPratt | CC BY-SA 4.0 |
added 17 characters in body
|
| Jul 23, 2023 at 0:14 | history | answered | RobPratt | CC BY-SA 4.0 |