A Combinatorial Problem Which Is Complete in Polynomial Space

Publisher Website
Google Scholar
Abstract
This paper considers a generalization, called the Shannon switching game on vertices, of a familiar board game called Hex. It is shown that determining who wins such a game if each player plays perfectly is very hard; in fact, if this game problem is solvable in polynomial time, then any problem solvable in polynomial space is solvable in polynomial time. This result suggests that the theory of combinational games is difficult.

This publication has 0 references indexed in Scilit: