Y
Hacker News
new
|
ask
|
show
|
jobs
by
robinhouston
1706 days 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?
1 comments
taintegral
1706 days ago
I 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!
link