|
| |
|
|
A079485
|
|
Number of chess games that end in checkmate after exactly n plies.
|
|
5
|
|
|
|
0, 0, 0, 0, 8, 347, 10828, 435767, 9852036, 400191963, 8790619155, 362290010907, 8361091858959
(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
|
Table of n, a(n) for n=0..12.
F. Labelle, Statistics on chess games
R. P. Stanley, Extremal [Chess] Problems
M. Willey, Iowa Chess Homepage.
J. Young, Opening Tree Statistics.
Index entries for sequences related to number of chess games
|
|
|
CROSSREFS
|
Cf. A006494, A048987, A089956.
Sequence in context: A016875 A046244 A193225 * A193504 A158363 A221044
Adjacent sequences: A079482 A079483 A079484 * A079486 A079487 A079488
|
|
|
KEYWORD
|
nonn,hard,nice
|
|
|
AUTHOR
|
N. J. A. Sloane, Jan 17 2003
|
|
|
EXTENSIONS
|
More terms from Richard Bean (rwb(AT)eskimo.com), Jun 08 2003
a(9) and a(10) from François Labelle, Jan 12 2004
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
a(12) from François Labelle (http://wismuth.com), Mar 04 2012.
|
|
|
STATUS
|
approved
|
| |
|
|
