Mystery
200
Bob
(The Game of NIM)
Alice and Bob play a game with a pile of 12 stones. During their turn, a player removes either 1, 2, or 3 stones from the pile. Alice makes the first move, and the player to remove the last stone from the pile wins. Assuming optimal play from both Alice and Bob, who will win?






test

Press F11 for full screen mode



Limited time offer: Membership 25% off


Clone | Edit | Download / Play Offline