Describe the a* search and give the proof of optimality of a*.
Answers
Answered by
1
"A* search in the computer science is an algorithm that is widely used in the process of pathfinding and graph traversal that is the process in which a path is found between the multiple points that are known as nodes. There are two condition in which A* is optimal,
• The monotonic heuristic condition, if h(ni)< h(ni+1), then the real-cost(ni)< real-cost(ni+1)
• The admissible heuristic condition as it will never overestimate the cost.
"
Similar questions