The position in the diagram is from a standard chess game, which you (an error-prone human) are playing as white against a perfectly optimal intelligence system (as black). The intelligence system began with a material handicap, allowing you to get to this position. On your last move, you captured the black queen with your king on h2, to complete a trade of queens. It is now your turn.
What is the least number of moves needed to checkmate black?
Hint 1: It is the nature of intelligent computer programs to, even in a losing position, extend the game by as many moves as possible. You can also assume that no resignations take place.
Hint 2: This is a hard problem, so think thoroughly!
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Move the pawn from d5 to e6 (en passent), an instant checkmate. This is because the only possible previous move for black is pawn e7 to e5 (as pointed out by the author, since the computer plays optimally, the pawn would have not been on e6 or else it would take the white rook on f5 instead), thus making the en passent move possible.