factual

P Equals PSPACE Would Enable Perfect Game Play

If polynomial time equaled polynomial space, then perfectly playing two-player games of perfect information like chess or Go — which can be solved with small memory by traversing the exponentially large game tree — would also become solvable in a small amount of time, yielding a super-efficient algorithm to play any such game perfectly, which is why we doubt P equals PSPACE.

factualpending

Speaker

Scott Aaronson

Evidence Quote

“if P were equal to PSPACE, that would mean that perfectly playing all these games would also be a problem that you could solve in a small amount of time”

Source

99 | Scott Aaronson on Complexity, Computation, and Quantum Gravity— Sean Carroll's Mindscape
Created: 6/13/2026, 12:26:25 AM

Your notes

Loading notes...