benchmarks.wiki / Public workspace

Omni-MATH / On a 3×3 chessboard, each square contains a knight with (1)/(2) probability. What is the probability that there are two knights that can attack each other? (In chess, a knight can …

Problem

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

problem

On a 3×33 \times 3 chessboard, each square contains a knight with 12\frac{1}{2} probability. What is the probability that there are two knights that can attack each other? (In chess, a knight can attack any piece which is two squares away from it in a particular direction and one square away in a perpendicular direction.)
Plain-text mathematical notation (without MathML)
On a 3×3 chessboard, each square contains a knight with (1)/(2) probability. What is the probability that there are two knights that can attack each other? (In chess, a knight can attack any piece which is two squares away from it in a particular direction and one square away in a perpendicular direction.)
Original LaTeX notation
On a $3 \times 3$ chessboard, each square contains a knight with $\frac{1}{2}$ probability. What is the probability that there are two knights that can attack each other? (In chess, a knight can attack any piece which is two squares away from it in a particular direction and one square away in a perpendicular direction.)

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