CS7050 : Heuristic Search problem


Problem Definition :

Given the maze below (5 x 6 nodes) find the shortest path between the starting node and the end node. Their are four permitted moves: Left, Right, Up and Down. On the other hand, the red nodes contain obstacles and no movements in them are possible through them. The boundaries are walls which are blocking the movements.

See how each algorithm searches:

Generate a new random maze: