Solving the Sabotage Game Is PSPACE-Hard
We consider the sabotage game as presented by van Benthem. In this game one player moves along the edges of a finite multi-graph and the other player takes out a link after each step. One can consider usual algorithmic tasks like reachability, Hamilton path, or complete search as winning conditions for this game. As the game definitely ends after at most the number of edges steps, it is easy to see that solving the sabotage game for the mentioned tasks takes at most PSPACE in the size of the graph. In this paper we establish the PSPACE-hardness of this problem. Furthermore, we introduce a modal logic over changing models to express tasks corresponding to the sabotage games and we show that model checking this logic is PSPACE-complete.
KeywordsModel Check Modal Logic Undirected Graph Hamilton Path Winning Strategy
Unable to display preview. Download preview PDF.
- 1.van Benthem, J.: An essay on sabotage and obstruction. In: Hutter, D., Werner, S. (eds.) Festschrift in Honour of Prof. Jörg Siekmann. LNCS (LNAI), Springer, Heidelberg (2002)Google Scholar
- 4.Löding, C., Rohde, P.: Solving the sabotage game is PSPACE-hard. Technical Report AIB-05-2003, RWTH Aachen (2003)Google Scholar