FJK Home CPE/CSC 480 F03 Syllabus Schedule Lecture Notes Assignments Project Other Links
CPE/CSC 480 F03 Artificial Intelligence Fall 2003

CPE/CSC 480 F03 Lab Exercise 1

In this lab exercise, you will use a tool in the "CISpace" Computational Intelligence Lab at UBC in Vancouver to explore different search algorithms. You need to go to the CI Space Web site at http://www.cs.ubc.ca/labs/lci/CIspace and invoke the "Search" applet. Alternatively, you can also download the code, and run it locally on your machine as Java application. The task is to experiment with the different search methods, and examine the way they work by looking at a number of examples.
  1. From the File Menu, load the sample graph "Simple Tree Graph". Under the Search Options Menu, turn on "Show Node Heuristics", "Show Edge Costs" and "Show Frontier" (not all of them are necessary for all methods). An example file for breadth-first search is provided in the file CI-Space-Search.html (http://www.csc.calpoly.edu/~fkurfess/Courses/CSC-480/F03/Assignments/CI-Space-Search.html).
  2. Examine the sample graph specified in the file CI-Search-CA.txt (http://www.csc.calpoly.edu/~fkurfess/Courses/CSC-480/F03/Assignments/CI-Search-CA.txt). This graph represents some distances between cities in California, and the goal is to explore paths between Bishop and San Luis Obispo. You can either copy and paste the contents of the file into the editing view of the Search applet, or download the code, run it as a Java application, and load the example file from there.
For these two tasks, it is advisable to experiment with different parameter settings (see "Search Options" and "Pruning" menus) to eliminate loops and other efficiency obstacles.

FJK Home CPE/CSC 480 F03 Syllabus Schedule Lecture Notes Assignments Project Other Links
© 2000-2023
Franz Kurfess