4 problems

One-quantum-move Nim solvability conjecture. For every such Z\ and \phi\, Z^{\mathrm{symBudgeted}[1]\mathcal Q(\phi,2)}\ is polynomial-time solvable. The same is conjectured…

Reachable poly-wide Demi-Quantum Nim conjecture. Reachable poly-wide \ruleset{\mathrm{demi\text{-}Quantum Nim}\ remains \cclass{PSPACE}\-hard to play optimally.

Constant-wide Demi-Quantum Nim conjecture. Constant-wide \ruleset{Demi-Quantum Nim}\ is \cclass{NP}\-hard to play optimally.

Quantum Avoid True conjecture. Determining the outcome class of \ruleset{Quantum Avoid True}\ with a classical start is \cclass{PSPACE}\-complete. Consequently, determining the…