| Revision as of 19:52, 30 September 2002 editFrecklefoot (talk | contribs)Autopatrolled, Extended confirmed users, Pending changes reviewers45,337 edits Added A*← Previous edit | Revision as of 17:44, 7 October 2002 edit undoFrecklefoot (talk | contribs)Autopatrolled, Extended confirmed users, Pending changes reviewers45,337 edits Moved A* into listNext edit → | ||
| Line 4: | Line 4: | ||
| * ] | * ] | ||
| * ] | * ] | ||
| * ] | |||
| A transcendental tree search algorithm called ] guarantees the shortest path from any beginning point to any end point. Despite this assurance, A* (pronounced "Ay-star") can be computationally expensive and is therefore not always used. | |||
Revision as of 17:44, 7 October 2002
Tree search algorithms are specialized versions of graph search algorithms, which take the properties of trees into account.