We discuss some results on the complexity of games and puzzles. In particular, we focus on the relationship between bounded treewidth and the (in-)tractability of games and puzzles in which graphs play a role. We discuss some general methods which are good starting points for finding complexity proofs for games and puzzles.
|Title of host publication||Treewidth, Kernels, and Algorithms|
|Editors||F. Fomin, S. Kratsch, E. van Leeuwen|
|Publication status||Published - 20 Apr 2020|
|Series||Lecture Notes in Computer Science|