login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A278830 Maximal number of possible moves at the n-th ply of a chess game. 2
20, 20, 31, 32, 46, 48, 52, 55, 61, 63 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

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

LINKS

Table of n, a(n) for n=1..10.

A. Dickins, Record number of legal moves in a legal position, 1968

OEIS index to sequences related to chess.

EXAMPLE

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 he 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.

Sequence in context: A010859 A291522 A303642 * A040381 A022354 A302363

Adjacent sequences:  A278827 A278828 A278829 * A278831 A278832 A278833

KEYWORD

nonn,hard,more,fini

AUTHOR

M. F. Hasler, Nov 29 2016

EXTENSIONS

a(3)-a(4) corrected and a(5)-a(10) from François Labelle, Nov 29 2016

STATUS

approved

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 November 14 22:45 EST 2019. Contains 329135 sequences. (Running on oeis4.)