Compound Node-Kayles on Paths

Abstract : In his celebrated book "On Number and Games" (Academic Press, New-York, 1976), J.H. Conway introduced twelve versions of compound games. We analyze these twelve versions for the Node-Kayles game on paths. For usual disjunctive compound, Node-Kayles has been solved for a long time under normal play, while it is still unsolved under misère play. We thus focus on the ten remaining versions, leaving only one of them unsolved.
Document type :
Journal articles
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00288659
Contributor : Eric Sopena <>
Submitted on : Monday, December 29, 2008 - 3:25:42 PM
Last modification on : Friday, April 12, 2019 - 10:18:03 AM
Long-term archiving on : Wednesday, September 22, 2010 - 11:09:37 AM

Files

web_gs08.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Adrien Guignard, Eric Sopena. Compound Node-Kayles on Paths. Theoretical Computer Science, Elsevier, 2009, 410 (21-23), pp.2033-2044. ⟨10.1016/j.tcs.2008.12.053⟩. ⟨hal-00288659v2⟩

Share

Metrics

Record views

294

Files downloads

222