If your maze is a maze without islands (that is, walls which are not connected to any wall surrounding the maze) and each corridor is at most one cell wide, there is a really nice way to reduce the maze to the path to the cheese, if such a path exists :
When this algorithm stops, you end up either with the path from the mouse to the cheese, or with an enclosed mouse (or cheese).
In reply to Re: Mouse Heuristic
by Corion
in thread Mouse Heuristic
by pope
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |