Higher nimbers in pawn endgames on large chessboards
Author
Published Version
http://www.msri.org/communications/books/Book42/contents.htmlMetadata
Show full item recordCitation
Elkies, 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.Abstract
We 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.Other Sources
http://arxiv.org/abs/math/0011253Terms of Use
This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAACitable link to this page
http://nrs.harvard.edu/urn-3:HUL.InstRepos:2886550
Collections
- FAS Scholarly Articles [18292]
Contact administrator regarding this item (to report mistakes or request changes)