olymmath

KöMaL 2005 K45

    In how many different ways is it possible to place a king and a castle on the chessboard so that neither attacks the other? (The fields of the chessboard are labelled by combinations of letters and numbers in the conventional way. Two configurations count as different if at least one of the two chessmen is placed on different fields in the two cases.)

    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/2005/k45 · Tag J8WPWN1P1W · Edit this page on GitHub · Keys: j next, k previous