Compound Node–Kayles on paths

In his celebrated book [J.H. Conway, On Numbers and Games, Academic Press, New-York, 1976, Second edition (2001), A.K. Peters, Wellesley, MA], 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,...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 410; no. 21; pp. 2033 - 2044
Main Authors:	Guignard, Adrien, Sopena, Éric
Format:	Journal Article
Language:	English
Published:	Oxford Elsevier B.V 17-05-2009 Elsevier
Subjects:	Applied sciences Combinatorial game Compound game Computer Science Computer science; control theory; systems Discrete Mathematics Exact sciences and technology Graph game Information retrieval. Graph Miscellaneous Node–Kayles Octal game 0.137 Theoretical computing Octal game 0.137 Compound game Graph game Node–Kayles Combinatorial game Computer theory Node Node-Kayles
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	In his celebrated book [J.H. Conway, On Numbers and Games, Academic Press, New-York, 1976, Second edition (2001), A.K. Peters, Wellesley, MA], 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.
Bibliography:	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
ISSN:	0304-3975 1879-2294
DOI:	10.1016/j.tcs.2008.12.053