olymmath

Putnam 2013 B6

  • Session B

Let n≥1n \geq 1 be an odd integer. Alice and Bob play the following game, taking alternating turns, with Alice playing first. The playing area consists of nn spaces, arranged in a line. Initially all spaces are empty. At each turn, a player either

  • places a stone in an empty space, or

  • removes a stone from a nonempty space ss, places a stone in the nearest empty space to the left of ss (if such a space exists), and places a stone in the nearest empty space to the right of ss (if such a space exists).

Furthermore, a move is permitted only if the resulting position has not occurred previously in the game. A player loses if he or she is unable to move. Assuming that both players play optimally throughout the game, what moves may Alice make on her first turn?

Curated text Kedlaya Putnam archive. Quoted with source.

Solutions

Human solution Solution 1 by Kiran Kedlaya and Lenny Ng

The terms of the source let olymmath link to this solution but not copy it. Read the solution (Kedlaya Putnam archive).

Similar problems

These problems have the most words in common with this statement.

Locator putnam/2013/b6 · Tag GWKBGMYMTP · Edit this page on GitHub · Keys: j next, k previous