To simulate first search program in a maze composed of 5 by 6 matrix, with barriers denoted as 1.

A star search is a heuristic function without any obstacles, hence h(x, y) or without obstacles <= distance to goal from x to y. The essence of A* search is keeps doing this: always choosing the shortest estimated path, until she reaches the goal.

It might seem counterintuitive but A star search doesn’t require knowledge of the most optimal path in advance. A* search often finds a solution much faster than other search methods like Dijkstra’s algorithm, which doesn’t use a heuristic and explores all directions equally.

Dynamic programing is to give you all possible positions in searching/path planning. In A star search we need to define heuristic function, while in dynamic programing, we define value function. it’s works recursively by minimizing the value plus 1