On the complexity of connection games.

In this paper, we study three connection games among the most widely played: havannah , twixt , and slither . We show that determining the outcome of an arbitrary input position is PSPACE -complete in all three cases. Our reductions are based on the popular graph problem generalized geography and on hex itself. We also consider the complexity of generalizations of hex parameterized by the length of the solution and establish that while short generalized hex is W[1] -hard, short hex is FPT . Finally, we prove that the ultra-weak solution to the empty starting position in hex cannot be fully adapted to any of these three games. [ABSTRACT FROM AUTHOR]