Game Development Reference
In-Depth Information
3
.
A heuristic is considered admissible if its estimated cost is less than or
equal to the actual cost.
4
.
Manhattan: 6. Euclidean:
.
5
.
The selected node has a star:
6
.
Dijkstra's algorithm.
7
.
When evaluating the cost of visiting a node, the A* algorithm takes into
account both the actual cost from the start node and the estimated cost to
the end node. Dijkstra's algorithm only looks at the actual cost from the
start node. The A* algorithm is generally more efficient than Dijkstra's
because it usually does not visit nearly as many nodes.
8
.
There are many potential solutions to this question. Here is one:
