A366476 Number of possible chmess games at the end of the n-th ply.

1, 25, 625

Offset

0,2

Comments

Chmess is an imaginary game very similar to chess, with the exception that the king can move two squares in any direction instead of just one. To get a(1) = 25 I am assuming the king can jump over an occupied square, but is not allowed to move out and back (which would give a(1) = 26).

References

Daniel C. Dennett, Higher-order truths about chmess, Topoi 25 (1-2):39-41 (2006).

Nigel Warburton, Review of "I've Been Thinking" by Daniel C. Dennett (Allen Lane, 2023), TLS #6290 (Oct 20, 2023), pp. 8-9.

Links

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

Daniel C. Dennett, Higher-order truths about chmess, Topoi 25 (1-2):39-41 (2006).

Crossrefs

Cf. A006494, A048987.

Sequence in context: A061614 A171330 A097780 * A209222 A207691 A207926

Adjacent sequences: A366473 A366474 A366475 * A366477 A366478 A366479

Keyword

nonn,more,bref

Author

N. J. A. Sloane, Oct 26 2023

Status

approved