|
Search: id:A048987
|
|
|
| A048987 |
|
Number of possible chess games at the end of the n-th plie. |
|
+0
9
|
|
| 1, 20, 400, 8902, 197281, 4865609, 119060324, 3195901860, 84998978956, 2439530234167, 69352859712417, 2097651003696806
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Does not include games which end in fewer than n plies.
According to the laws of chess, the "50 move rule" and "draw by repetition of position" require an appeal by one of the players. So infinite games are possible.
|
|
LINKS
|
A. Bertilsson, Distributed Perft Project [also found a(11)]
F. Labelle, Statistics on chess games
T. Sillke, number of legal chess positions
R. P. Stanley, Extremal [Chess] Problems
Index entries for sequences related to number of chess games
|
|
CROSSREFS
|
Cf. A006494, A079485, A083276, A019319.
Sequence in context: A057745 A009964 A007577 this_sequence A006494 A007545 A055476
Adjacent sequences: A048984 A048985 A048986 this_sequence A048988 A048989 A048990
|
|
KEYWORD
|
nonn,nice,hard
|
|
AUTHOR
|
Steven J. Edwards (sje(AT)mv.mv.com)
|
|
EXTENSIONS
|
a(10) from Richard Bean (rwb(AT)eskimo.com), Jun 02 2003
a(11) from Francois Labelle (flab(AT)cs.berkeley.edu), Jul 25 2004, who thanks Joost de Heer for providing computer time.
|
|
|
Search completed in 0.002 seconds
|
