OFFSET
0,2
COMMENTS
Gives the number of possible chess games where both sides start without bishops.
Does not include games which end in fewer than n plies.
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.
Initial terms computed using the Chesspresso engine.
EXAMPLE
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.
CROSSREFS
KEYWORD
nonn,hard,more,fini
AUTHOR
Sean A. Irvine, Apr 28 2017
STATUS
approved