|
Search: id:A079485
|
|
|
| A079485 |
|
Number of chess games that end in checkmate after exactly n plies. |
|
+0
6
|
|
| 0, 0, 0, 0, 8, 347, 10828, 435767, 9852036, 400191963, 8790619155, 362290010907
(list; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
COMMENT
|
a(6) was computed in 1897.
|
|
REFERENCES
|
H. Simpson, Chess Review, Jan-Feb 1982.
|
|
LINKS
|
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.
Adjacent sequences: A079482 A079483 A079484 this_sequence A079486 A079487 A079488
Sequence in context: A002781 A016875 A046244 this_sequence A158363 A000436 A015507
|
|
KEYWORD
|
nonn,hard,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Jan 17 2003
|
|
EXTENSIONS
|
More terms from Richard Bean (rwb(AT)eskimo.com), Jun 08 2003
a(9) and a(10) from Francois Labelle (flab(AT)cs.berkeley.edu), Jan 12 2004
a(11) from Francois Labelle (flab(AT)cs.berkeley.edu), 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 (meijgia(AT)hotmail.com), Mar 01 2009
|
|
|
Search completed in 0.002 seconds
|
