OME 2017 Problem 4
You are given a row made by squares, numbered consecutively from to . Initially, there is a coin in the square . Two players and play alternatively, starting with , on the following way: In his turn, each player can either make his coin advance squares or make the coin go back squares. On each move the coin can never go to a number less than or greater than . The player who puts the coin on the square wins. ¿Who is the one with the wining strategy and how should he play to win?
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.