Problem #PRU-86553

Problems Set theory and logic Theory of algotithms Theory of algorithms (other)

Problem

A game with 25 coins. In a row there are 25 coins. For a turn it is allowed to take one or two neighbouring coins. The player who has nothing to take loses.