For questions related to the A* (or A) search algorithm, which is a very famous state-space search algorithm and widely taught in Computer Science and Artificial Intelligence. A* is a best-first search algorithm that is guaranteed to find the optimal solution given an admissible heuristic function, so A* is also an informed search algorithm, as opposed to e.g. depth-first search, which is an uninformed search algorithm.
About
Stats
|
created |
3 years, 8 months ago |
|
viewed |
6 times |
|
active |
1 year, 6 months ago |
|
editors |
1 |
Top Answerers
more »
Recent Hot Answers
What are the differences between Q-Learning and A*?Why is A* optimal if the heuristic function is admissible?
How is iterative deepening A* better than A*?
What are the differences between A* and greedy best-first search?
How do I show that uniform-cost search is a special case of A*?
more »