Question: A* algorithm Consider the following graph and the heuristic value table. The number in the graph shows the distance between two states. Value h(n) is
A* algorithm
Consider the following graph and the heuristic value table. The number in the graph shows the distance between two states. Value h(n) is the heuristic value for each state n. Run tree-search A* algorithm to find a path from J to A. Draw the search tree with the node you expand and give the f(n) and g(n) values for each node generate during your search. [30 marks]

| n | A | B | C | D | E | F | G | H | I | J |
| h(n) | 0 | 30 | 35 | 33 | 15 | 35 | 45 | 48 | 62 | 58 |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
