cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-5 of 5 results.

A057745 Erroneous version of A083276.

Original entry on oeis.org

1, 20, 400, 5362, 72078, 822518, 9417683
Offset: 0

Views

Author

Keywords

Comments

This is considered erroneous because it counts as distinct two positions at ply 6 where in one case, an en passant capture is available but illegal, while in the other case, the en passant capture is not available. It is questionable whether two such positions should be considered equivalent, since the definition of position (as opposed to diagram) includes the information on whether en passant is available (i.e., pseudolegal), not whether it is legal. [Depending on the variant of chess that is played, it may be allowed to make otherwise "illegal" moves which expose one's king to a capture.] - M. F. Hasler, Mar 02 2022

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

Original entry on oeis.org

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

Views

Author

Keywords

Comments

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

Crossrefs

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

Extensions

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"

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

Views

Author

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

Keywords

Comments

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

References

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

Crossrefs

Extensions

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

A089957 Number of chess positions that can be obtained in exactly one way in n plies.

Original entry on oeis.org

1, 20, 400, 1862, 9825, 53516, 311642, 2018993, 12150635, 69284509, 382383387, 1994236773
Offset: 0

Views

Author

François Labelle, Jan 12 2004

Keywords

Comments

Definition: position = position with castling and en passant information, diagram = position without castling and en passant information.
The positions are taken from the sets that are counted in A083276.

Crossrefs

Extensions

a(9) from François Labelle, Mar 09 2004
a(10) from Arkadiusz Wesolowski, Jan 04 2012
a(11) from Peter Österlund on Feb 22 2013, verified by François Labelle on Jan 08 2017

A278830 Maximal number of possible moves at the n-th ply of a chess game.

Original entry on oeis.org

20, 20, 31, 32, 46, 48, 52, 55, 61, 63
Offset: 1

Views

Author

M. F. Hasler, Nov 29 2016

Keywords

Comments

In view of the 75-moves rule any chess game is finite.
The largest value appearing in the sequence is thought to be 218. - François Labelle, Dec 01 2016

Examples

			In the initial position of the chess game, each player has 20 possible moves (16 pawn moves and 4 knight moves), and the first (half-)move made by White does not affect the 20 possibilities Black will have thereafter.
At its second move, i.e., ply 3 of the game, White may have as much as 31 possible moves, if White started with e2-e4 as first move, and Black offered a pawn with d7-d5 or f7-f5.
		

Crossrefs

Cf. A278831: minimal number of possible moves at the n-th ply.
Cf. A278832: maximal material difference at the end of the n-th ply.
Cf. A083276.

Extensions

a(3)-a(4) corrected and a(5)-a(10) from François Labelle, Nov 29 2016
Showing 1-5 of 5 results.