Uninformed Search Strategies – Artificial Intelligence
2020-05-28
Breadth-first search (BFS) It is a simple search strategy where the root node is expanded first, then covering all other successors of the root node, further move to expand the next level nodes and the search continues until the goal node is not found. BFS expands the shallowest (i.e., not deep)Continue Reading