Dan, Sam and their new friend Dimitri (the one who plays chess), play a game in which the first to start says the number 1, the next says 2, and the one who's next must say an integer number between the number previously said and its double (but not including).
For example, Dan begins saying 1, then Sam says 2, and then Dimitri can say whichever number he wants between 2 and 4; as the only integer between 2 and 4 is 3, he must say . Then, Dan can choose any number between 3 and 6; that is, he can say either 4 or 5.
The game finishes when anyone reaches 150 (who is the winner). If Dan begins and then goes Sam, who will win? This means, who has a winning strategy?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let's suppose that somebody has a winning strategy, and call him X. Let's analyze the numbers that X must have told in order to win.
The one that was before him (Y) should have said any number between 76 and 149, including the endpoints. In fact, Y was forced to say a number in that interval, because X has a winning strategy. By the same reason, this means that Z was forced to say 75... but how is this possible? In the previous turn, X said k , so Z could have replied any number between k + 1 and 2 k − 1 (including endpoints); k could have been at most 38, because if it was a greater number, then Z could have said 76, so Y would have win. But, Z could have said any number between 39 and 75... actually, Z was not forced to say 75.
We have a contradiction, because this means that X does not have a winning strategy, contradicting our hypothesis that X was the optimally winner. Therefore, nobody has a winning strategy.