It's worth pointing out that even tic-tac-toe is PSPACE-complete. Here is a StackExchange question discussing the "solvability" of PSPACE vs NP: http://cstheory

It's worth pointing out that even tic-tac-toe is PSPACE-complete. Here is a StackExchange question discussing the "solvability" of PSPACE vs NP: http://cstheory.stackexchange.com/questions/5323/are-pspace-complete-problems-inherently-less-tractable-than-np-complete-prob http://cstheory.stackexchange.com/questions/5323/are-pspace-...