It expands the node that is estimated to be closest to goal. It expands nodes based on f(n) = h(n). It is implemented using priority queue.
Disadvantage: It can get stuck in loops. It is not optimal.
Latest posts by FreelancingGig (see all)
- Everything You Need to Know About Proxies: What and When to Use It - January 20, 2021
- 7 Top Tips To Create A Stand Out Freelancer Profile - January 18, 2021
- 5 Mistakes Graphic Designers Make When Starting Out — And How to Avoid Them - January 11, 2021