olymmath

BD-BDMO 2019 Problem 10

    Given 2020∗20202020*2020 chessboard, what is the maximum number of warriors you can put on its cells such that no two warriors attack each other. Warrior is a special chess piece which can move either 33 steps forward and one step sideward and 22 step forward and 22 step sideward in any direction.

    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.

    Add a solution

    Similar problems

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

    Locator bd-bdmo/2019/p10 · Tag XVXCY5X1XA · Edit this page on GitHub · Keys: j next, k previous