PSpace-completeness conjecture for Pirates and Treasure
Statement
Consider the decision problem Pirates and Treasure, whose input is a graph and whose outcome is determined by the game's scoring-play rules. PSpace-completeness conjecture. Pirates and Treasure is PSpace-complete. The problem is stated to lie in PSpace, while its membership in NP is considered unlikely; the source gives no resolution of PSpace-hardness or PSpace-completeness.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.