olymmath

RU-ALLRUSSIAN 1978 Problem 11

    Two players play a game by moving a piece on an n x n chessboard. The piece is initially in a corner square. Each player may move the piece to any adjacent square (which shares a side with its current square), except that the piece may never occupy the same square twice. The first player who is unable to move loses. Show that for even n the first player can always win, and for odd n the second player can always win. Who wins if the piece is initially on a square adjacent to the corner?

    Dataset text NuminaMath olympiads. 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.

    Add a solution

    Locator ru-allrussian/1978/p11 · Tag 7T0EKY32RC · Edit this page on GitHub · Keys: j next, k previous