Graph NoGo is NP-hard

Last week, I mentioned we had some computational complexity results concerning the game NoGo , which was the "new game" played at the game workshop at BIRS this year. After getting more comfortable with the game play, it felt like the game might be another great example of PSPACE-completeness. I put some effort into solving this, knowing it would be great to resolve the complexity while at the workshop. Finding gadgets is tough, sometimes especially when dealing with the sort of grid-geo