@zaasmi said in CS607 Assignment 1 Solution and Discussion:
Questions No. 01 10 marks
Consider the search space below, where A is the start node and O is a goal node. Consider the tree as given below, show in table displaying how does BFS (Breadth First Search) work on given tree using simple search algorithm.
c3237491-42f0-444b-ba5b-97fc590bc779-image.png