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 \((x,y)\) (the square where the piece will move to, you should add coordinate \(x\) + coordinate \(y\)) X the amount of legal moves black can play after white's first move as your answer. The starting rank coordinates is \((0,0)\).

Try not to use a chess engine when solving this problem!

×

Problem Loading...

Note Loading...

Set Loading...