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)
- Maximizing Home Office Productivity: 5 Essential Tips for Remote Workers - April 26, 2024
- Choosing the Right Tech Stack for Your Food Delivery App - April 25, 2024
- Boost Sales with PPC Marketing Strategies in Sydney - March 20, 2024