Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- def breadthFirstSearch(problem):
- """
- Search the shallowest nodes in the search tree first.
- [2nd Edition: p 73, 3rd Edition: p 82]
- """
- "*** YOUR CODE HERE ***"
- node = problem.getStartState()
- if (problem.isGoalState(node)):
- return node
- frontier = Queue()
Add Comment
Please, Sign In to add comment
