This curious game was invented by Princeton mathematician John H. Conway.
Two players take turns naming positive integers, but an integer is off limits if it's the sum of nonnegative multiples of integers already been named.
Once 1 is named, everything is off limits (because no new positive integer can be named).
A player forced to name "1" - i.e. having no other choice loses the game.
Devise a winning strategy for the 1st player.
It seems like that once 2 and 3 are selected,then the next player is forced to pick 1 and lose. Knowing only this, if I was the first player, I'd pick not(2 or 3). then as soon as the other player picked either 2 or 3, I'd pick the other and force a win. Not sure if this always forces a win however, it could be an infinitely long game if both payer can do enough math in their heads.
|
|
Posted by Kenny M
on 2017-12-23 14:59:07 |
First thoughts
