Higher nimbers in pawn endgames on large chessboards
MetadataShow full item record
CitationElkies, Noam D. 2002. Higher nimbers in pawn endgames on large chessboards. In More Games of No Chance 42, ed. Richard J. Nowakowski, 61-78. Cambridge: Cambridge University Press.
AbstractWe answer a question posed in [Elkies 1996] by constructing a class of pawn endgames on mXn boards that show the Nimbers *k for many large . We do this by modifying and generalizing T.R. Dawson’s “pawns game” [Berlekamp et al. 1982]. Our construction works for m ≥ 9 and n sufficiently large; on the basis of computational evidence we conjecture, but cannot yet prove, that the construction yields *k for all integers k.
Citable link to this pagehttp://nrs.harvard.edu/urn-3:HUL.InstRepos:2886550
- FAS Scholarly Articles