olymmath

MEMO 2016 T3

    A 8×88 \times 8 board is given, with sides directed north-south and east-west. It is divided into 1×11 \times 1 cells in the usual manner. In each cell, there is most one house. A house occupies only one cell.

    A house is in the shade if there is a house in each of the cells in the south, east and west sides of its cell. In particular, no house placed on the south, east or west side of the board is in the shade.

    Find the maximal number of houses that can be placed on the board such that no house is in the shade.

    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 memo/2016/t3 · Tag 7JNR084HMK · Edit this page on GitHub · Keys: j next, k previous