Algorithm idea
An example of informed search is the A∗ search whose the search guidance is provided by a heuristic function, and it evaluates nodes using the cost function f(n) = g(n) + h(n). With h(n) is the heuristic function estimates the cheapest path from n to goal, g(n) is the actual cost from the start node to n node and f(n) is estimated total cost of the cheapest solution path going through n.
The algorithm will expand the nodes with the smallest value of f(n)
Guide
Drag the START(😊) and TARGET(🏠) icons to change their positions, and click on the blank nodes to add Walls.
Start Node
Target Node
Wall
Visited
Shortest Path