olymmath

HMMT November 2021 U20

  • Guts
  • Answer

On a chessboard, a queen attacks every square it can reach by moving from its current square along a row, column, or diagonal without passing through a different square that is occupied by a chess piece. Find the number of ways in which three indistinguishable queens can be placed on an 8×88 \times 8 chess board so that each queen attacks both others.

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

864

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 hmnt/2021/u20 · Tag 3N5RMFR36B · Edit this page on GitHub · Keys: j next, k previous