The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.



Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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)



a(6) was computed in 1897.


H. Simpson, Chess Review, Jan-Feb 1982.


Table of n, a(n) for n=0..13.

F. Labelle, Statistics on chess games

R. P. Stanley, Extremal [Chess] Problems

M. Willey, Iowa Chess Homepage.

World Chess Federation, Laws of Chess: For competitions starting on or after 1 July 2014

J. Young, Opening Tree Statistics.

Index entries for sequences related to number of chess games


Cf. A006494, A048987, A089956.

Sequence in context: A305488 A305088 A316739 * A193504 A158363 A221044

Adjacent sequences:  A079482 A079483 A079484 * A079486 A079487 A079488




N. J. A. Sloane, Jan 17 2003


More terms from Richard Bean, 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, Mar 04 2012

a(13) from François Labelle, Aug 15 2017



Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 20 11:11 EST 2020. Contains 331083 sequences. (Running on oeis4.)