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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A285874 Number of possible chess games at the end of the n-th ply starting without rooks. 7
1, 20, 400, 8702, 188473, 4505624, 106770421, 2770746488, 71151220765, 1969755500063 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Gives the number of possible chess games where both sides start without rooks.  Rooks are still allowed to appear later in the game through promotion.

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

The total number of such games should be less than the total number of standard chess games, and it appears A285874(n) <= A048987(n) for all n.

Initial terms computed using the Chesspresso engine.

LINKS

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

Bernhard Seybold, Chesspresso.

CROSSREFS

Cf. A048987 (standard), A285873 (no queens), A285875 (no knights), A285876 (no bishops), A285877 (no pawns), A285878 (pawns and king).

Sequence in context: A171294 A267793 A009964 * A007577 A048987 A006494

Adjacent sequences:  A285871 A285872 A285873 * A285875 A285876 A285877

KEYWORD

nonn,hard,more,fini

AUTHOR

Sean A. Irvine, Apr 28 2017

EXTENSIONS

a(9) from Sean A. Irvine, May 04 2017

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified February 20 15:02 EST 2018. Contains 299380 sequences. (Running on oeis4.)