3 ms·
This is an interesting puzzle. It not obviously in NP. My guess would be that it’s PSPACE-complete. Have you thought about the complexity at all?
by robinhouston 5y ago
This is an interesting puzzle.
It not obviously in NP. My guess would be that it’s PSPACE-complete. Have you thought about the complexity at all?
- taintegral 5y agoI gave the thought some idle time, but it's been so long since I've constructed a proper hardness proof. If I do, I'll definitely make a post about it!