Week 11 - Begin Intelligent Search

The material from this week is all about taking a bunch of things we have been talking about this semester and applying them to the domain of solving some simple AI problems. In particular, how you search for a solution in an intelligent manner.

Materials

Kicking off the last couple of weeks:

• Watch - Motivating the wrap up [Video, 6 minutes]

In the very first class you took, FCCS, we talked about Intelligent Search. At the time we talked about it very conceptually. This week we are going to begin to talk about this from a code perspective. Having said that, I want you to review the materials we used in that class so that you can frame the code discussions.

• Activity
  • Consider the Analysts and Hackers canoe problem
  • Scratch Program you can use to test Analysts and Hackers
    • Press the green flag to reset the program.
• Readings
• If you still have your FCCS textbook, you should review the material from Section 11.3 - pp 574-585 in your book
• If you don't have your textbook anymore, here is the same set of pages from the international edition as a pdf.
• Videos
• Watch - Introduction to Search Problems (Production Systems) [Video, 20 minutes]
• Watch - Analysts and Hackers - Breadth First Search [Video, 18 minutes]
• Watch - Analysts and Hackers - Depth First Search [Video, 11 minutes]

Now that you have reviewed the previous material, let's look at the code that could be used to solve this.

• Watch - The generic search algorithm introduced, and the analaysis of BFS and DFS [Video - 23 Minutes]
• The generic search algorithm
  • 


• Watch - From Generic Pseudocode to the BFS solution [Video, 6 minutes]
• canoe_BFS.py
• queue_code.py
• canoeNode.py


• Watch - The canoeNode explained [Video - 7 minutes]
• Watch - Walking the tree to build the solution [Video - 4 minutes]
• Watch - Generating Children (and wrapping it all up) [Video - 8.5 minutes]
• Watch - The generic search algorithm implemented for DFS [Video - 4 Minutes]]
  • canoe_DFS.py
  • stack_code.py
  • canoeNode.py [same as above]

Another example using traveling in Romania

• Watch - Introducing the Romania Search [Video, 4 minutes]
  • The map of Romania
• Watch - BFS for Romania explained [Video - 8 Minutes]
  • romania_BFS.py
  • cityNode.py
• Watch - DFS for Romania explained [Video - 4 Minutes]
  • romania_DFS.py