 Further work showed that it was significantly more difficult than NP problems; it is PSPACE-complete.This is of interest for artificial intelligence (AI) research because solving "Sokoban" can be compared to the automated planning required by some autonomous robots.