|
Search: id:A007545
|
|
|
| A007545 |
|
Number of chess games with n plies (another version).
(Formerly M5100)
|
|
+0
1
|
|
| 1, 20, 400, 8902, 197742, 4897256, 120921506, 3284294545, 88867026005
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Up to a(6) this is the number of chess games with all legality constraints removed, even allowing the king to be captured. (This differs from the number of positions in suicide chess, as suicide chess contains compulsory captures.) - Richard Bean (rwb(AT)eskimo.com), Jun 18 2003
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
Index entries for sequences related to number of chess games
|
|
CROSSREFS
|
Cf. A048987.
Sequence in context: A007577 A048987 A006494 this_sequence A055476 A041181 A041762
Adjacent sequences: A007542 A007543 A007544 this_sequence A007546 A007547 A007548
|
|
KEYWORD
|
fini,nonn,hard
|
|
AUTHOR
|
Ken Thompson (ken(AT)plan9.bell-labs.com)
|
|
EXTENSIONS
|
I am not sure of the precise rules that were used to compute these numbers. A006494 and A048987 are the preferred versions of this sequence. - N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
