Home Products Download Order Contacts

comp.graphics.algorithms

Subject: Re: Correctness of Dijkstra & A*



A* works if its heuristic is admissible, i.e. if the heuristic never
overestimates the value of the shortest path from this node to the
goal, then the algorithm finds the optimal solution.

A* is very simple to understand with a figure and an example. Chapter 4
of the Rusell and Norvig A.I. book is a very good reference.


Reply


View All Messages in comp.graphics.algorithms

path:
Correctness of Dijkstra & A* =>

Replies:
Re: Correctness of Dijkstra & A*
Re: Correctness of Dijkstra & A*

Copyright 2006 WatermarkFactory.com. All Rights Reserved.