In this chapter, to help you understand the BFS algorithm, we revisited the concepts of state and node. You learned about the graph and queue data structures, and we discussed the differences between the DFS and BFS algorithms.
In the next chapter, you'll be learning about the heuristic search algorithm. Instead of giving preference to child or sibling nodes, this method gives preference to the nodes that are closest to the goal state; the term heuristic refers to the measure of how close the nodes are to the goal state.
Please refer to the link https://www.packtpub.com/sites/default/files/downloads/HandsOnArtificialIntelligenceforSearch_ColorImages.pdf for the colored images of this chapter.
