, 3 , then B's answer depends on 3 mod 3. If 3 ? 0 mod 3, B may reply by taking 1 vertex in S , so as to leave P 3?1 + S 1,1,2,3 . Indeed, from Lemma 24, we know that G(S 1,1,2,3 ) = 2 = G(P 3?1 ), thus P 3?1 + S 1,1,2,3 is a P-position. If 3 ? 1 mod 3, B may reply by taking 2 vertices in S
3+3 , then B removes 4 vertices from S , so as to leave P 3?1 + P 3?1, vol.1 ,
,
, B can reply by taking 1 vertex in S , so as to leave P 3 + S 1,2,2,3 , which is a P-position. Indeed, from Lemma 27, we know that G(S 1,1,2,3 ) = G(P 3 ) = 3 mod 3. If S = S 1,2,3+3 , then B may reply by removing 1 vertex from S , so as to leave P 3 + P 3+3 , which is a P-position. If S = S 1,5,3 , then B may reply by removing 1 vertex from S , so as to leave P 3 + P 3+6, vol.2
, , p.4
Combinatorial analysis of a subtraction game on graphs, 2015. ,
, Lessons in Play: an Introduction to Combinatorial Game Theory, 2007.
Octal games on graphs: the game 0.33 on subdivided stars and bistars, Theoret. Comput. Sci, vol.746, pp.19-35, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01418153
, Winning Ways for Your Mathematical Plays, 2001.
, Kayles on the way to the stars, International Conference on Computers and Games, 2004.
A Nim game played on graphs, Theoret. Comput. Sci, vol.304, issue.1-3, pp.387-399, 2003. ,
A Nim game played on graphs II, Theoret. Comput. Sci, vol.304, issue.1-3, pp.401-419, 2003. ,
Unsolved problems in combinatorial games, Games of No Chance, vol.29, 1996. ,
Polynomial time graph families for Arc-Kayles, Integers, vol.16, 2016. ,
On the complexity of some two-person perfect-information games, J. Comput. System Sci, vol.16, issue.2, pp.185-225, 1978. ,
Combinatorial game theory, vol.146, 2013. ,
Uber mathematische Kampfspiele, Tohoku Mathematical Journal, First Series, vol.41, pp.438-444, 1935. ,