Revised problem15a.cpp to incorporate a fast exit (find only half of paths, since the inverse of all valid paths are valid as well.  Let me solve the problem (21x21 grid, path length of 40) in about 45 minutes.