Games, Puzzles and Treewidth

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Abstract

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.
Original languageEnglish
Title of host publicationTreewidth, Kernels, and Algorithms
EditorsF. Fomin, S. Kratsch, E. van Leeuwen
PublisherSpringer, Cham
Pages247-261
ISBN (Electronic)978-3-030-42071-0
ISBN (Print)978-3-030-42070-3
DOIs
Publication statusPublished - 20 Apr 2020

Publication series

SeriesLecture Notes in Computer Science
Volume12160
ISSN0302-9743

Keywords

  • complexity
  • games
  • puzzles
  • treewidth

Cite this