HMMT 2002 E2
- General 1
- Answer
Eight knights are randomly placed on a chessboard (not necessarily on distinct squares). A knight on a given square attacks all the squares that can be reached by moving either (1) two squares up or down followed by one squares left or right, or (2) two squares left or right followed by one square up or down. Find the probability that every square, occupied or not, is attacked by some knight.
Dataset text NuminaMath olympiads. Quoted with source.
Also HMMT 2002 V1.
Show the answer
0
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.