ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider the decision problem Pirates and Treasure, whose input is a graph GG 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 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.