On the Descriptive Complexity of a Simplified Game of Hex

The game Whex is here defined, which is similar to Generalized Hex but the players are restricted to colour vertices adjacent to the vertex last coloured by one of the players. It is shown that the problem of deciding existence of winning strategies for one of the players in this game is complete for PSPACE, via quantifier free projections, and that the… CONTINUE READING