Problems which depend on SAN disambiguation

This page contains the moves up to ply 10 that determine all the previous moves uniquely and depend on SAN disambiguation. Remember that in SAN, ambiguities are resolved by specifying the file, and if this fails, the rank instead. For example, if the problem says "Raxa3", then there must be a second rook capable of capturing the piece on a3 to justify the disambiguation.

This is very weird and I'd be interested to know about any other chess problem of any type which depends on SAN disambiguation.

SAN (Standard Algebraic Notation) is the notation used in most modern chess publications and in PGN files. For a mathematically precise definition of SAN, see the Portable Game Notation Specification, Section 8.2.3.

ply 8

4... Raxa3
4... Raxa4
4... Rhxa3
4... Rhxa4

ply 9

5. Rcxa6
5. Rdxa5
5. Rdxa6
5. Rexa5
5. Rexa6
5. Rfxa5
5. Rfxa6
5. Rgxa5
5. Rgxa6

ply 10

5... N4c6#
5... N8c6#
5... N8h6#
5... Ndc6#

back to Moves that determine all the previous moves