ProbXiv
Explorersign in
Problem archiveProblem record

Statement

The Builder-Blocker general position games are played on a graph, with Builder and Blocker alternately selecting vertices according to the rules defining the games; the associated decision problems ask whether Builder has a winning strategy. PSPACE-completeness conjecture. The decision version of the B- and B'-games are PSPACE-complete. This conjecture concerns the computational complexity of deciding the winner in these games and is motivated by the known hardness of the avoidment game; its resolution is left as an open problem.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.