Today we present one of the longest mates in 2 ever. You see, a normal mate in two is… two moves. This mate in 2 involves 32 moves. How is that possible?
You’ll need to find a mate in 2 on each file and rank individually. Therefore, you need to solve 16 separate mate in 2 problems.
Challenge yourself and share you solutions!
J. Spencer “St. Paul Dispatch”, 1906
White to move and mate in 2 on each file and rank
Here is an example:
Give it a try!