This is an interesting puzzle. It not obviously in NP. My guess would be that it... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		robinhouston on Oct 14, 2021 \| parent \| context \| favorite \| on: Solving NP-hard puzzles with the oldest trick in t... 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 on Oct 14, 2021 [–]

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!

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact