On the parameterized complexity of finding short winning strategies in combinatorial games
| dc.contributor.author | Scott, Allan Edward Jolicoeur | |
| dc.contributor.supervisor | Stege, Ulrike | |
| dc.date.accessioned | 2010-04-29T22:14:06Z | |
| dc.date.available | 2010-04-29T22:14:06Z | |
| dc.date.copyright | 2009 | en |
| dc.date.issued | 2010-04-29T22:14:06Z | |
| dc.degree.department | Department of Computer Science | |
| dc.degree.level | Doctor of Philosophy Ph.D. | en |
| dc.description.abstract | A combinatorial game is a game in which all players have perfect information and there is no element of chance; some well-known examples include othello, checkers, and chess. When people play combinatorial games they develop strategies, which can be viewed as a function which takes as input a game position and returns a move to make from that position. A strategy is winning if it guarantees the player victory despite whatever legal moves any opponent may make in response. The classical complexity of deciding whether a winning strategy exists for a given position in some combinatorial game has been well-studied both in general and for many specific combinatorial games. The vast majority of these problems are, depending on the specific properties of the game or class of games being studied, complete for either PSPACE or EXP. In the parameterized complexity setting, Downey and Fellows initiated a study of "short" (or k-move) winning strategy problems. This can be seen as a generalization of "mate-in-k" chess problems, in which the goal is to find a strategy which checkmates your opponent within k moves regardless of how he responds. In their monograph on parameterized complexity, Downey and Fellows suggested that AW[*] was the "natural home" of short winning strategy problems, but there has been little work in this field since then. In this thesis, we study the parameterized complexity of finding short winning strategies in combinatorial games. We consider both the general and several specific cases. In the general case we show that many short games are as hard classically as their original variants, and that finding a short winning strategy is hard for AW[P] when the rules are implemented as succinct circuits. For specific short games, we show that endgame problems for checkers and othello are in FPT, that alternating hitting set, hex, and the non-endgame problem for othello are in AW[*], and that short chess is AW[*]-complete. We also consider pursuit-evasion parameterized by the number of cops. We show that two variants of pursuit-evasion are AW[*]-hard, and that the short versions of these problems are AW[*]-complete. | en |
| dc.identifier.bibliographicCitation | A.Scott. Short pursuit-evasion. In Texts in Algorithmics 7: Algorithms and Complexity in Durham 2006, pages 141-152, 2006. | en |
| dc.identifier.bibliographicCitation | A.Scott and U.Stege. Parameterized chess. In Parameterized and Exact Computation, pages 172-189 ,2008. | en |
| dc.identifier.uri | http://hdl.handle.net/1828/2676 | |
| dc.language | English | eng |
| dc.language.iso | en | en |
| dc.rights | Available to the World Wide Web | en |
| dc.subject | computational complexity | en |
| dc.subject | combinatorial game theory | en |
| dc.subject | parameterized complexity | en |
| dc.subject | algorithmic combinatorial game theory | en |
| dc.subject.lcsh | UVic Subject Index::Sciences and Engineering::Applied Sciences::Computer science | en |
| dc.title | On the parameterized complexity of finding short winning strategies in combinatorial games | en |
| dc.type | Thesis | en |