C / C++ / MFC

CBetterGroupbox::OnCommand(WPARAM wParam, LPARAM lParam)
{
    CWnd *pParent = GetParent();
    ASSERT_VALID(pParent);
    pParent->SendMessage(WM_COMMAND, wParam, lParam);
}

0-Base Case?
  Yes - return true.
  No  - continue.
1-Select a direction to move [iterate through all directions].
2-Can you move in that direction?
  Yes - Move, then recurse.
    If function returns true - return true.
    If function returns false - undo move, loop to 1.
  No  - Loop to 1
3-Return false [You've tried all directions at this level of recursion].

• You check for unescapable mazes by verifying whether you have returned to the start position. This is wrong: consider a maze where you initially face a dead-end corridor; eventually you'll have to come to the start position, but that doesn't mean there are no alternative routes.
  
• Seems you're not checking whether you stumble into walls; instead you check for free space. If you happen to run into a wall, solve_maze will just exit.
  
• Seems like you change direction at every step, so if you start in a position with no walls around, you'll go N-E-S-W and return to the start without exploring anything.

bool solve_maze(row,col,direction) // depth-first strategy
{
  if(in exit) return true; // we did it
  if(!(we can advance in direction)) return false; // hit a wall or a place we already were at
  move in direction; // update row and col
  mark position; // use 'x' for instance
  if(solve_maze(row,col,north)||solve_maze(row,col,east)||
     solve_maze(row,col,south)||solve_maze(row,col,west)){
    return true; // 'x's mark the way out.
  }
  else{ 
    // we tried every direction to no avail. Return false
    // indicating failure. Recursion will take care of trying
    // previous positions.
    unmark position; // clear out this failed step
    return false;
  }
}