ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider the decision problem \scTrailTrap P2-win{\sc Trail Trap}\ {\rm P}{2}\text{-win}: given a graph, determine whether the second player has a winning strategy in Trail Trap. Trail Trap PSPACE-completeness conjecture. The problem \scTrailTrap P2-win{\sc Trail Trap}\ {\rm P}{2}\text{-win} is PSPACE-complete. The paper establishes NP-hardness on connected bipartite planar graphs of maximum degree 44, but does not prove PSPACE-completeness; the conjectured stronger complexity classification remains open.

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.