Description: This is a an applet written that implements A* search. The robot starts from the lower right corner and then searches the maze space for the goal. All the dashes ('-') are where the robot has searched. The dots ('.') is the optimum path that the robot has found. By default the path costs for N,E,W, and S are 1.

You may set the cost for a move to the diagonal. You may also choose which heuristic the robot uses to find its way to the goal.
< zero > a simple breadth-first-search. H=0.
< straight-line > the straightline distance between where the robot is and there the goal is.
< x-direction > the distance between where the robot is and there the goal is on the x-axis.
< y-direction > the distance between where the robot is and there the goal is on the y-axis.
< maximum > the best of all value of any given heuristics.

Rules: There must be a start and goal state. Start state is marked by a capital 'S' and the goal state by 'G'. The pound symbol '#' indicates what a wall is - the robot cannot go through these.