Summary:

You will play the role of a blind agent, running an online depth-first-search algorithm

Preparation

1. Open your book to page 126 and review the ONLINE-DFS-AGENT algorithm in Figure 4.20.
2. Launch the exploration program
   1. On the MathLAN, start a Terminal window
   2. Launch the program by typing the command  
        
      /home/weinman/courses/CSC261/code/online/explore

Exercise

• Your group was assigned a number:
  • Odd groups: Order your actions A B C D
  • Even groups: Order your actions C D A B
• One person should narrate the algorithm, describing what to do. The other person should do the bookkeeping (updating the tables).
• Switch roles after six moves.
• When (if) you have found the goal, you should diagram the state space you have discovered.
• If you still have time, explore further to complete the state space graph by continuing to follow the algorithm.

Reflection

• What roll does the unbacktracked queue play?
• How would you characterize the behavior? Does it seem efficient?
• How hard is this problem?
  • What if we had more states?
  • What if we had a continuous environment?