Klavžar–Tian–Tuite complexity conjecture for Builder/Blocker games
Statement
Consider the Builder/Blocker games denoted by the B-game and B'-game, together with their decision versions. Klavžar–Tian–Tuite's conjecture. The decision versions of the B- and B'-games are PSPACE-complete.
The complexity of these decision problems was described as completely unknown before this conjecture. The conjectured PSPACE-completeness 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.