benchmarks.wiki / Public workspace

Omni-MATH / On a chessboard, a queen attacks every square it can reach by moving from its…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

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.
Plain-text mathematical notation (without MathML)
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×8 chess board so that each queen attacks both others.
Original LaTeX notation
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 \times 8$ chess board so that each queen attacks both others.

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import