|
|
A079485
|
|
Number of chess games that end in checkmate after exactly n plies.
|
|
6
|
|
|
0, 0, 0, 0, 8, 347, 10828, 435767, 9852036, 400191963, 8790619155, 362290010907, 8361091858959, 346742245764219
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,5
|
|
COMMENTS
|
a(6) was computed in 1897.
|
|
REFERENCES
|
H. Simpson, Chess Review, Jan-Feb 1982.
|
|
LINKS
|
|
|
EXAMPLE
|
a(n) = 0 for n < 4 and a(4) = 8, because the earliest checkmate can occur at move 2, e.g., with 1.f3 e5, 2.g4 Qh4#. The 8 = 2*2*2 possibilities counted in a(4) all correspond to essentially the same mate, with (1) the alternative 1.f4, (2) the alternative 1...e6, (3) inversed order of white's moves. - M. F. Hasler, Mar 03 2022
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more,nice,fini
|
|
AUTHOR
|
|
|
EXTENSIONS
|
a(11) from François Labelle, Jul 25 2004, who thanks Joost de Heer for providing computer time.
Link to Extremal [Chess] Problems of R. P. Stanley corrected by Johannes W. Meijer, Mar 01 2009
|
|
STATUS
|
approved
|
|
|
|