The scope of this thesis is to simulate, analysze and compare four path planning methods to find the way out of the maze based on breadth first search algoritm, depth first search algorithm, random walk and A* algoritm. The simulations are carried out using Labview. The approaches are compared in terms of parameters such as total steps taken and execution time of the algorithms to reach the goal point. From the simulation results obtained, BFS is the optimal algorithm among ununiformed searches. Results obtained indicate that the A* algorithm is a suitable choice in this case as its computational cost is lower than that of the other methods. The time taken for executing A* algorithm is faster than other algorithms in the same configuration space.