benchmarks.wiki

benchmarks.wiki / Public workspace

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

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 Chinese knight with 12\frac{1}{2} probability. What is the probability that there are two Chinese knights that can attack each other? (In Chinese chess, a Chinese knight can attack any piece which is two squares away from it in a particular direction and one square away in a perpendicular direction, under the condition that there is no other piece immediately adjacent to it in the first direction.)
Plain-text mathematical notation (without MathML)
On a 3×3 chessboard, each square contains a Chinese knight with (1)/(2) probability. What is the probability that there are two Chinese knights that can attack each other? (In Chinese chess, a Chinese knight can attack any piece which is two squares away from it in a particular direction and one square away in a perpendicular direction, under the condition that there is no other piece immediately adjacent to it in the first direction.)
Original LaTeX notation
On a $3 \times 3$ chessboard, each square contains a Chinese knight with $\frac{1}{2}$ probability. What is the probability that there are two Chinese knights that can attack each other? (In Chinese chess, a Chinese knight can attack any piece which is two squares away from it in a particular direction and one square away in a perpendicular direction, under the condition that there is no other piece immediately adjacent to it in the first 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

task_id
7c9bceca-4aa9-5bf1-bb44-7693871fa6f9
task_key
test--7c9bceca-4aa9-5bf1-bb44-7693871fa6f9
task_revision_id
1
config / split
/ test

Official source

initial import