Take a look at the position below.
White to move.
What is the least amount of moves that white can checkmate black, assuming both sides play optimally?
Also, what is the first move by white?
Give the least amount of moves X the coordinates of the target square (the square where the piece will move to, you should add coordinate + coordinate ) X the amount of legal moves black can play after white's first move as your answer. The starting rank coordinates is .
Try not to use a chess engine when solving this problem!
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.
Relevant wiki: Chess Puzzles
This problem was composed by T. Taverner in 1881 1.Rh1!! Whatever black plays, he will be checkmated next move:
If 1...c3 then 2.Nd3# If 1...Bxc7 then 2.Rh4# If 1...Be7 2.e3# If 1...Bf6 2.Qf5# If 1...Bg5 2.Qh2# If 1...Bh4 2.Rxh4# If 1...Bxh7 2.Nd5# If 1...Bf7 2.Qf5# If 1...Be6 2.e3# If 1...Bd5 2.Nxd5# If 1...Rf7 2.Nd5# If 1...Re7 2.Rh4# If 1...Rf6 2.Rh4# If 1...Re6 2.Nd5# If 1...Rf5 2.Qxf5# If 1...Re5 2.Qg4# If 1...Re4 2.fxe4# If 1...Re3 2.Bh2# If 1...Rxe2+ 2.Nxe2#