A079485 -id:A079485 - cp's OEIS frontend

A048987 Number of possible chess games at the end of the n-th ply.

1, 20, 400, 8902, 197281, 4865609, 119060324, 3195901860, 84998978956, 2439530234167, 69352859712417, 2097651003696806, 62854969236701747, 1981066775000396239, 61885021521585529237, 2015099950053364471960

Offset: 0

S. J. Edwards

Does not include games which end in fewer than n plies.

According to the laws of chess, the "50-move rule" and "draw by 3-fold repetition" do not prevent infinite games because they require an appeal by one of the players, but the "75-move rule" introduced on Jul 01 2014 is automatic and makes chess finite. - François Labelle, Mar 30 2015

A. Bertilsson, Distributed Perft Project [also found a(11)]
James Grime and Brady Haran, How many chess games are possible? (Numberphile video), 2015.
Jakub Kowalski, Marek Szykuła, Experimental Studies in General Game Playing: An Experience Report, University of Wrocław, (Poland, 2020).
F. Labelle, Statistics on chess games
T. Sillke, number of legal chess positions
R. P. Stanley, Extremal [Chess] Problems
Wikipedia, Shannon number
Index entries for sequences related to number of chess games

Cf. A006494, A079485, A083276, A019319, A285873 (no queens), A285874 (no rooks), A285875 (no knights), A285876 (no bishops), A285877 (no pawns), A285878 (pawns and king).

a(10) from Richard Bean, Jun 02 2003
a(11) from François Labelle, Jul 25 2004, who thanks Joost de Heer for providing computer time
a(12) from Paul Byrne on Oct 24 2006, verified by S. J. Edwards on Apr 25 2011
a(13) from Paul Byrne on Nov 08 2011, verified by S. J. Edwards on Oct 03 2012
a(14) from Richard Bean on Jul 24 2018, value from Peter Osterlund and Ankan Banerjee
a(15) from Paul Barnett on Jul 04 2022, value from wikipedia page "Shannon number"

A006494 Number of possible chess games at the end of the n-th ply plus number of games that terminate (i.e., mate) in fewer than n plies.

Original entry on oeis.org

1, 20, 400, 8902, 197281, 4865617, 119060679, 3195913043, 84999425906, 2439540533153, 69353270203366, 2097660204806910, 62855340727822758, 1981075507583376209

Offset: 0

Ken Thompson (ken(AT)google.com)

This sequence is A048987 plus the cumulative sum of A079485. - Richard Bean, Jun 18 2003

The word "terminate" is inappropriate if only termination by checkmate is considered, since games can also end in a draw. The earliest possible draws occur by threefold or 5-fold repetition of the starting position through, e.g., twofold resp. 4-fold repetition of the moves 1.Nf3 Nf6 2.Ng1 Ng8, or an equivalent sequence. - M. F. Hasler, Mar 02 2022

James Gleick, Faster, Vintage Books, NY, 2000 (see pp. 259-261).

Eric Weisstein's World of Mathematics, Chess
Index entries for sequences related to number of chess games

Cf. A048987, A079485.

a(8)-a(10) from François Labelle, Jan 22 2004
a(11) from François Labelle, Jul 25 2004, who thanks Joost de Heer for providing computer time
a(12) from François Labelle, Mar 04 2012
a(13) from François Labelle, Aug 15 2017

A019319 Number of possible chess diagrams after n plies.

Original entry on oeis.org

1, 20, 400, 5362, 71852, 815677, 9260610, 94305342, 958605819, 8866424380, 81766238574, 692390232505

Offset: 0

Bernd Schwarzkopf (schwarzkopf(AT)uni-duesseldorf.de)

Definition: position = position with castling and en passant information, diagram = position without castling and en passant information.
Even though the sequence may be infinite (if none of the rules for draw is ever invoked by any of the players), the sequence becomes constant from a given rank n on, since it is increasing (I conjecture - even though some positions available at the n-th move might not be available on the (1+n)-th move) and bounded, thus it has a limit. The challenge is now to find this limit (or at least nontrivial upper bounds) and the rank from which on the sequence becomes constant. - M. F. Hasler, Feb 15 2008
The sequence became finite on Jul 01 2014 with the introduction of a new draw rule which is automatic (the 75-move rule). About Hasler's second challenge, a chess problem by L. Ceriani and K. Fabel shows that at least one position is visited for the first time at ply 366. - François Labelle, Apr 01 2015

Bernd Schwarzkopf, Die ersten Züge (The First Moves), Problemkiste (No. 92, April 1994, p. 142-143).

L. Ceriani, K. Fabel, Chess problem: Non-unique proof game in 183 moves, Am Rande des Schachbretts, 1947
F. Labelle, Statistics on chess positions
Eric Weisstein's World of Mathematics, Chess
Index entries for sequences related to number of chess games

Cf. A083276, A048987, A090051, A006494, A079485, A019319.

More terms from Richard Bean, Jun 02 2002
a(6)-a(8) from François Labelle, Jan 19 2004
a(9)-a(10) from Arkadiusz Wesolowski, Jan 04 2012
a(11) from François Labelle, Jan 16 2017

A089956 Number of chess games that end in check (but not checkmate) after exactly n plies.

Original entry on oeis.org

0, 0, 0, 12, 461, 27004, 798271, 32668081, 959129557, 35695709940, 1078854669486, 39147687661803, 1224448528652016, 44252532348552226

Offset: 0

François Labelle, Jan 12 2004

Cf. A079485, A048987.

a(11) from François Labelle, Jul 25 2004, who thanks Joost de Heer for providing computer time.
a(12) from François Labelle, Mar 04 2012
a(13) from François Labelle, Aug 15 2017

A157851 Number of possible Fischer Random Chess games at the end of the n-th ply.

Original entry on oeis.org

960, 18882, 371766, 8224968, 181106056, 4433048830, 107637760217, 2854198413886, 75006431287937

Offset: 0

Johannes W. Meijer & Richard Pijl (richard.pijl(AT)telenet.be), Mar 07 2009, Feb 25 2010

Fischer Random Chess is also called Chess960 because the number of different initial positions is 960.
The number of possible games at the end of the n-th ply is the sum of all possible games on all 960 boards with a different initial position.
The number of possible first moves for white depends on the following three factors:
a) The eight pawns.
b) The positions of the two knights. If they are on a1 and/or h1 the number of possible moves reduces from 20 to 18 or 19. On the 960 boards there are 240 boards with a knight on a1. Looking more closely at the positions of the second knight on these 240 boards reveals that 36 knights can be found on b1, d1, f1 and h1 and 32 knights can be found on c1, e1 and g1, something that can be proved with some simple combinatorics.
c) The possibility of castling. On the 960 boards there are 72 boards with a king on d1 and a rook on c1 and there are 90 boards with a king on f1 and a rook on g1. Both positions allow castling under the Fischer Random Chess rules.
These three factors lead to the following partition of the 960 boards (K = King; R = Rook; N = Knight; NoN = No Knight; NoC = No castling allowed): 454 (NoNa1+NoNh1+NoC), 162 (Na1+NoNh1+NoC), 160 (Nh1+NoNa1+NoC), 34 (NoNa1+NoNh1+Kf1+Rg1), 28 (NoNa1+NoNh1+Kd1+Rc1), 28 (Nh1+NoNa1+Kf1+Rg1), 22 (Na1+Nh1+NoC), 22 (Na1+NoNh1+Kd1+Rc1), 20 (Na1+NoNh1+Kf1+Rg1), 16 (Nh1+NoNa1+Kd1+Rc1), 8 (Na1+Nh1+Kf1+Rg1), 6 (Na1+Nh1+Kd1+Rc1).
The first three terms of the sequence can be calculated in a straightforward way, see the examples. The values of a(1) and a(2) were confirmed by Richard Pijl with his Fischer Random Chess playing chess engine The Baron, see the links. He also determined the values of a(3), a(4) and a(5).
The Baron 3.41 now gives different values for a(3)-a(6), confirmed by my own chess engine. - François Labelle, Dec 05 2017

			a(0) = 4 (Bishop) * 4 (Bishop) * 6 (Queen) * 10 (Knights) * 1 (King and Rooks) = 960.
a(1) = 36*18 + 204*19 + 204*19 + 516*20 + 90 + 72 = 18882.
a(2) = 22*18^2 + (162+160+8+6)*19^2 + (454+28+22+20+16)*20^2 + (34+28)*21^2 = 371766.

Chessgames.com, Fischerandom Chess Generator
Chessvariants.com, Fischer Random Chess
Richard Pijl, The Baron
Wikipedia, Chess960

Cf. Chess: A006494, A048987, A079485.
Cf. Go: A007565, A048289.
Cf. Checkers: A133046, A133047.

import chess
def A157851(n, b = None): return (b.legal_moves.count() if b else 960) if not n else sum(b.push(m) or A157851(n-1, b)+(not b.pop()) for m in b.legal_moves) if b else sum(A157851(n-1, chess.Board.from_chess960_pos(s)) for s in range(960)) # (For illustration, slow for n > 3.) - M. F. Hasler, Apr 25 2023

Corrected and edited by Johannes W. Meijer, Feb 25 2010, Mar 03 2010
a(6) added by Richard Pijl (richard.pijl(AT)telenet.be). - Johannes W. Meijer, May 29 2010
a(3)-a(6) corrected by François Labelle, Dec 05 2017
a(7)-a(8) from François Labelle, Jan 18 2018

A258110 Number of Mirror Chess games that end in checkmate after exactly n moves.

Original entry on oeis.org

0, 0, 0, 0, 3, 212, 10592, 449977, 17727425, 680781219, 26046238416, 1001222256515, 38764377926857, 1511202832516487

Offset: 0

Jeremy Gardiner, May 20 2015

			a(4) = 3 because of these checkmates:
1. c4 c5 2. Qa4 Qa5 3. Qc6 Qc3 4. Qxc8#
1. d4 d5 2. Qd3 Qd6 3. Qh3 Qh6 4. Qxc8#
1. d4 d5 2. Qd3 Qd6 3. Qf5 Qf4 4. Qxc8#

J. Loy, A Mirror Chess Problem

Cf. A079485, A136257.

a(5)-a(13) from François Labelle, May 25 2015

cp's OEIS Frontend

A048987 Number of possible chess games at the end of the n-th ply.

Views

Author

Keywords

Comments

Links

Crossrefs

Extensions

A006494 Number of possible chess games at the end of the n-th ply plus number of games that terminate (i.e., mate) in fewer than n plies.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Extensions

A019319 Number of possible chess diagrams after n plies.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Extensions

A089956 Number of chess games that end in check (but not checkmate) after exactly n plies.

Views

Author

Keywords

Links

Crossrefs

Extensions

A157851 Number of possible Fischer Random Chess games at the end of the n-th ply.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

Extensions

A258110 Number of Mirror Chess games that end in checkmate after exactly n moves.

Views

Author

Keywords

Examples

Links

Crossrefs

Extensions