Re:Solving NP-hard puzzles with the oldest trick in the book
by robinhouston on Thursday October 14, 2021 @11:03AM
(#28865249)
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?
[ Parent
| on HN ]
Re:Solving NP-hard puzzles with the oldest trick in the book
by taintegral on Thursday October 14, 2021 @11:10AM
(#28865377)
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!