Maze

Create a maze or load an existing one and let the explorer find the exit with his search algorithm.

White cells are empty rooms. Black cells are walls. The green cell is the starting point and the red cell is the finishing point.
The explorer only knows the rooms he has been before. He can't see the exit and he can't see rooms that he has never been into.
The explorer tries to find the exit in the fewest moves possible, given that he has no clue where to search first.

Basic exploration algorithm:
1. Search adjacent cells for the first empty cell
2. If found, move there and place the direction of the movement made to the new cell
3. Otherwise, move to the opposite of the current cell direction (backtracking)