Related articles:
Breadth-first search
Depth-first search
Priority queue
Key terms:
y
math
node
path
goal
search
cost
score
algorithm
heuristic
queue
distance
estimate
admissible
optimal
ties
graph
le d
tentative
empty
neighbors
behave
traversed
search algorithm
considers
closed set
goal node
priority queue
complexity
open set
reconstruct
initial node
shortest path
consistent
optimistic
guaranteed
implementation
generalized
other words
exponential
current node
optimal path
incremental heuristic search
same heuristic
admissible heuristic
usually denoted
heuristic estimate
distance to the goal
cost of a path through
expand fewer nodes than
Search external links cited by footnotes on Wikipedia page A* search algorithm:
|
|