MathDB

Arnim and Brentano have a little vase with

1500

candies on the table and a huge sack with spare candies under the table. They play a game taking turns, Arnim begins . At each move a player can either eat

7

candies or take

6

candies from under the table and add them to the vase. A player cannot go under the table in two consecutive moves. A player is declared the winner if he leaves the vase empty. In any other case, if a player cannot make a move in his turn, the game is declared a tie. Is there a winning strategy for one of the players?

Problem Statement