olymmath

KöMaL 2010 B4242

    Is there an nn, such that it is possible to walk the 4×nn chessboard with a knight touching each field exactly once so that with a last step the knight returns to its original position? What happens if the knight is not required to return to the original position?

    Official text KöMaL. 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

    Similar problems

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

    Locator hu-komal/2010/b4242 · Tag ZK5FYG9YWZ · Edit this page on GitHub · Keys: j next, k previous