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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A285876 Number of possible chess games at the end of the n-th ply starting without bishops. 7

%I

%S 1,22,484,11248,260904,6434922,158069690,4126252938,107097735673,

%T 2940365284820

%N Number of possible chess games at the end of the n-th ply starting without bishops.

%C Gives the number of possible chess games where both sides start without bishops.

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

%C The initial terms exceed the corresponding terms in A048987, but this should eventually reverse and we should have A285876(n) <= A048987(n) for large enough n.

%C Initial terms computed using the Chesspresso engine.

%H <a href="http://www.chesspresso.org/">Chesspresso<sup>TM</sup></a>.

%e a(1) = 22 because we have the standard 20 opening moves, plus the queen and king can each move into the squares that would normally contain the bishops.

%Y Cf. A048987 (standard), A285873 (no queens), A285874 (no rooks), A285875 (no knights), A285877 (no pawns), A285878 (pawns and king).

%K nonn,hard,more,fini

%O 0,2

%A _Sean A. Irvine_, Apr 28 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 February 29 05:25 EST 2020. Contains 332353 sequences. (Running on oeis4.)