@inbook{ad713e2825174a3aadd35b9c8950b318,
title = "Solving Bicoloring-Graph Games on Rectangular Boards - Part 1: Partisan Col and Snort",
abstract = "In this paper we give an overview of results obtained for solving the combinatorial games of Col and Snort on rectangular boards. For Col on boards with at least one dimension even we give a strategy guaranteeing a win for the second player. For Col on general odd {\texttimes} odd boards we found no applicable strategy, though all experimental data show second-player wins. For Linear Col we were able to prove using Combinatorial Game Theory (CGT) that all chains, including odd-length chains, are second-player wins. A similar strategy as for Col guarantees for Snort on boards with both dimensions even a win for the second player and with at least one dimension odd a first-player win. Snort therefore is completely solved.",
author = "J.W.H.M. Uiterwijk",
note = "Funding Information: We greatfully acknowledge our cooperation with Ewan Demeur. Some of the strategies found were inspired by and formulated during discussions of his thesis research and lead to a deeper insight into the topics of this paper. Publisher Copyright: {\textcopyright} 2022, Springer Nature Switzerland AG.; 17th International Conference on Advances in Computer Games (ACG) ; Conference date: 23-11-2021 Through 25-11-2021",
year = "2022",
doi = "10.1007/978-3-031-11488-5\_9",
language = "English",
isbn = "9783031114878",
series = "Lecture Notes in Computer Science",
publisher = "Springer International Publishing AG",
pages = "96--106",
editor = "Cameron Browne and Akihiro Kishimoto and Jonathan Schaeffer",
booktitle = "Advances in Computer Games - 17th International Conference, ACG 2021, Revised Selected Papers",
}