You should now understand what a heuristic function is, and also the priority queue data structure. In this chapter, you learned how to visualize search trees. You learned the heuristic function for a greedy best-first search and the steps involved in this algorithm. We also covered problems related to the greedy best-first algorithm, and how an A* Search solves them. Finally, you learned the properties required for a good heuristic function.
- Tech Categories
- Best Sellers
- New Releases
- Books
- Videos
- Audiobooks
Tech Categories Popular Audiobooks
- Articles
- Newsletters
- Free Learning
You're reading from Hands-On Artificial Intelligence for Search
Devangini Patel is a PhD student at the National University of Singapore, Singapore. Her research interests include deep learning, computer vision, machine learning, and artificial intelligence. She has completed a master's in artificial intelligence at the University of Southampton, UK. She has over 5 years, experience in the field of AI and has worked on various industrial and research projects in AI, including facial expression analysis, robotics, virtual try-on, object recognition and detection, and advertisement ranking.
Read more about Devangini Patel
Unlock this book and the full library FREE for 7 days
Author (1)
Devangini Patel is a PhD student at the National University of Singapore, Singapore. Her research interests include deep learning, computer vision, machine learning, and artificial intelligence. She has completed a master's in artificial intelligence at the University of Southampton, UK. She has over 5 years, experience in the field of AI and has worked on various industrial and research projects in AI, including facial expression analysis, robotics, virtual try-on, object recognition and detection, and advertisement ranking.
Read more about Devangini Patel