Compound Node-Kayles on Paths
| dc.creator | Guignard, Adrien | |
| dc.creator | Sopena, Eric | |
| dc.date | 2008-06-18 | |
| dc.date | 2009-01-05 | |
| dc.date.accessioned | 2026-07-07T13:07:02Z | |
| dc.date.available | 2026-07-07T13:07:02Z | |
| dc.description | 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. | |
| dc.description | Theoretical Computer Science (2009) to appear | |
| dc.identifier | https://arxiv.org/abs/0806.3033 | |
| dc.identifier | http://arxiv.org/abs/0806.3033 | |
| dc.identifier | Theoretical Computer Science 410, 21-23 (2009) 2033-2044 | |
| dc.identifier | doi:10.1016/j.tcs.2008.12.053 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/227967 | |
| dc.subject | Discrete Mathematics | |
| dc.title | Compound Node-Kayles on Paths | |
| dc.type | text |