These are the two strategies which are quite similar. In the best first search, we expand the nodes in accordance with the evaluation function. While in breadth-first search a node is expanded in accordance with the cost function of the parent node