6.01
Staff/Schedule Grading Policies Collaboration Policy Archived Announcements
Progress
Course Notes Python and lib601 Circuit Part Specifications
Help Queue Piazza
Log In☰
Home / Week 12 Exercises / Deep, Very Deep

Deep, Very Deep

The questions below are due on Friday May 10, 2019; 05:00:00 PM.
 
You are not logged in.

If you are a current student, please Log In for full access to this page.
Music for this Problem

 

We are going to compare different search techniques on this graph. Assume that:

  • the start state is A
  • the goal state is F
  • the successors (children) of a state are pushed onto the agenda in REVERSE alphabetical order
  • we are not considering paths that revisit the same state (within the path)

Enter your answers below as a sequence of state names, with no punctuation,

e.g. A B D

What path will be found by breadth-first search:

What path will be found by depth-first search: