OFFSET
0,2
COMMENTS
Chess diagrams are chess positions without regard to whether castling or en passant capturing is possible. They are counted in A019319. A shortest proof game (SPG) is a classic type of chess problem. Most published SPGs are dual-free (have only one solution), which is why we count diagrams that are obtained in exactly one way in the minimum number of plies.
LINKS
CROSSREFS
KEYWORD
nonn,hard,fini,more
AUTHOR
François Labelle, Mar 04 2012
EXTENSIONS
a(11) from François Labelle, Feb 27 2017
STATUS
approved