Problem #PRU-116849

Problems Discrete Mathematics Algorithm Theory Theory of algorithms (other)

Problem

2012 pine cones lay under the fir-tree. Winnie the Pooh and the donkey Eeyore play a game: they take turns picking up these pine cones. Winnie-the-Pooh takes either one or four cones in each of his turns, and Eeyore – either one or three. Winnie the Pooh goes first. The player who cannot make a move loses. Which of the players can be guaranteed to win, no matter how their opponent plays?