Bologna Sandwich was worried about an upcoming test in Discrete Mathematics and was finding it hard to get to sleep. Bologna awoke early in the morning, aroused by devilish laughter, only to see an impish looking homunculus sitting at the bottom of the bed next to a seemingly infinite pile of chips. Hello, Bologna, it said, would you like to play a little game? This pile contains 43546758443209876 chips and the bottom chip represents your immortal soul. The rules are quite simple. The first player removes some chips, but not all of them. After that we take turns removing some chips.
The only rule now is that a player cannot remove more than the previous player removed in his last turn. The winner is the player who takes the last chip. If I win I get to keep your soul and if you win, you get an A in the test. Would you like to go first or second? This seemed a reasonable bet to Bologna.
Can you give Bologna a strategy for playing no matter how many chips there are? (What if there were just one more chip in the initial pile?)
What if the rule were that one is allowed to take up to twice the number of chips the previous player took?
(In reply to Is there any way...
Is there a strategy that will allow play to proceed at a pace that will allow completion in a reasonable amount of time, such as before the test in question is to take place?
Sure, if both players know who is going to win at the outset the one who is going to lose can concede. (I suppose in reality both players should continue and hope the other makes a mistake.)
In any game, such as this, with no element of chance, among two perfect players, the winner is a foregone conclusion. They may as well not play.
Posted by Jer
on 2004-05-10 14:31:28