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.
Please refer to the link https://www.packtpub.com/sites/default/files/downloads/HandsOnArtificialIntelligenceforSearch_ColorImages.pdf for the colored images of this chapter.
