This page shows "Type A" Last Move problems.
The game here is to find check-free diagrams such that the stipulation "Last move?" has a unique solution.
We have solutions for all 60 Type A tasks, but in most cases we don't know if these are minimal. The one outstanding task is en passant, and seems unlikely to be solvable.
Back to home page