Question: There are n sticks (n>1) in a stack. Two persons play the game with the first player in his first turn never removes all. Every
There are n sticks (n>1) in a stack. Two persons play the game with the first player in his first turn never removes all. Every subsequent player must remove at least one, if there is, and at most double the number of sticks his opponent removed in his last turn. Player emptying the stack wins the game. How should the game be played if you start with 22?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
