A codex of N- and P-positions in Harary's 'caterpillar game'

Richard M. LOW, Ardak KAPBASOV, Arman KAPBASOV, Stephen C. LOCKE, Wai Hong CHAN

Research output: Contribution to journalArticlespeer-review

Abstract

Frank Harary proposed the following game: Given a caterpillar C, two players take turns removing edges of a path. The player who takes the last edge wins the game. In this paper, we completely characterize the N - and P-positions for all caterpillars with spine length zero, one, two and three. Furthermore, we analyze approximately 94% of the caterpillars with spine length greater than or equal to four. In those cases, they all turn out to be N -positions. Copyright © 2021 Colgate University. All rights reserved.
Original languageEnglish
Article numberG1
JournalINTEGERS: Electronic Journal of Combinatorial Number Theory
Volume21
Early online date01 Feb 2021
Publication statusPublished - 2021

Citation

Low, R. M., Kapbasov, A., Kapbasov, A., Locke, S. C., & Chan, W. H. (2021). A codex of N- and P-positions in Harary's 'caterpillar game'. INTEGERS: Electronic Journal of Combinatorial Number Theory, 21. Retrieved from http://math.colgate.edu/~integers/vol21.html

Fingerprint Dive into the research topics of 'A codex of N- and P-positions in Harary's 'caterpillar game''. Together they form a unique fingerprint.