• Python string list/* files random math time class/object tk(1) tk(2)
• Norvig site
• Elkner book
• Computer Systems Lab

Fall Semester

1. Word Ladders
2. Navigating Across Romania
3. Sliding Tile Puzzles
4. N-Queens and Local Search
5. GHOST
6. Tic-Tac-Toe
7. Reversi

Spring Semester

1. Edge Detection
2. Hough Transform
3. Segregation Models
4. Sugarscape
5. Map Coloring
6. Sudoku Solvers
7. Machine Learning

Tentative Calendar for 2009-2010

• Sep Oct Nov Dec Jan Feb Mar Apr May Jun

Syllabus for 2009-2010

• AI_syllabus_2009_2010.pdf

Fall Semester

1. Word Ladders

   • 4963 six-letter words
     • Known missing words: summer, paltry, powers, goober, hummer, bummer
   • Lab01.pdf
     • Introduction.pdf
     • spell_0.py
     • spell_1.py
     • spell_2.py
     • spell_3.py
   • Lab02.pdf
     • Graphs.pdf
     • freq_0.py
     • freq_1.py
     • freq_2.py
     • miscellaneous_0.py
   • Lab03.pdf
     • Search.pdf
     • dfs_on_a_binary_tree_0.py
     • dfs_on_a_binary_tree_1.py
     • AncestorParadox.pdf
   • Back to top

2. Navigating Across Romania

   • Road Map
     • xy.txt
     • edge_list.txt
     • Edge costs will not match Russell and Norvig.
   • Lab04.pdf
   • Lab05.pdf
     • Romania.pdf
     • romania_map.png
     • heapq
   • Other Examples with Larger Graphs
     • www.census.gov
       • ww.txt
       • U.S. waterways, latitude-longitude followed by edge list.
       • For a small enough geographic area use lat-long as xy.
       • Try from 52420 to 57510, length is 226.449 units.
       • Try from 295270 to 37420, path has 235 nodes.
     • Fairfax County Roads
       • roads.txt (7.3MB)
       • roads-explanation.txt
       • Thanks to 2011dladwig.
     • www.caida.org
       • internet-xy.txt (2.6MB)
       • internet.txt (7.0MB)
       • Servers connected on the Internet.
       • Thanks to 2011akessler.
   • Back to top

3. Sliding Tile Puzzles

   • Lab06.pdf
     • SlidingTile.pdf
     • tk_demo.py
     • img_demo.py
     • hulk.jpg
     • bind
   • Presentations.pdf
     • First tell us your name.
     • Then tell us your topic.
     • Provide a clear explanation.
     • Include at least one example.
     • Leave time for questions.
   • Back to top

4. N-Queens and Local Search

   • Lab07.pdf
     • NQueens.pdf (under construction)
     • Challenge...
       • Find global min in data.txt while also minimizing lookups.
       • Brute force complete search takes 11^3=1331 lookups.
       • First three columns are input and last column is output.
       • data.txt
   • Back to top

5. GHOST

   • 38713 words
     • Known missing words: pheromone, yams, juts, jutted, jive, jives, jived, jiving, jilt, jilts, jilting, jilted, jogger, joggers, jogged, hubbub, hoax, juxtaposition, pommel, xenophobic, cheeseburger, cheeseburgers, chainsaw, chainsaws, bible, myopia, myopic, kelp, quatrain
   • Lab08.pdf (UPDATE: due 12/16) [UPDATE: late on 1/7]
   • Lab09.pdf (UPDATE: due 12/23) [UPDATE: due on 1/8]
     • Ghost.pdf (under construction) [UPDATED on 1/5]
     • word_tree.pdf (old)
     • Test case: random royal rower rowing runner running
     • Test case: blank blonde block blue shirt short shot
   • Back to top

6. Tic-Tac-Toe

   • Lab09.pdf (cancelled, two GHOST labs instead)
     • TicTacToe.pdf
   • Back to top

7. Reversi

   • Lab10.pdf
     • Reversi.pdf
     • Old website
     • To create PYC files run a tournament by passing ANY command-line argument to the referee.
     • Or, just type IMPORT FILENAME from the python shell.
   • Back to top

Spring Semester

1. Edge Detection

   • Lab11.pdf
     • Sobel
     • Late after Friday, 26 February
   • Lab12.pdf
     • Canny
     • Late after Friday, 5 March
   • Back to top

2. Hough Transform

   • Lab13.pdf
     • shapes.pgm
     • shapes_canny.ppm
     • shapes_cluster.pgm
     • shapes_cluster_10.pgm
     • shapes_cluster_16.pgm
     • shapes_hough.ppm
     • shapes_hough_bins_10.ppm
     • shapes_hough_bins_16.ppm
     • rdist.png
   • Back to top

3. Segregation Models

   • Lab14.pdf
   • Back to top

4. Sugarscape

   • Lab15.pdf
   • Demonstrations.pdf
     • First tell us your name.
     • Then tell us the name of your program.
     • Explain briefly the background or context.
     • Show an interesting run of the program.
     • Leave time for questions.
   • Back to top

5. Map Coloring

   • Lab16.pdf
   • Lab17.pdf
   • Back to top

6. Sudoku Solvers

   • Lab18.pdf
   • Back to top

7. Machine Learning

   • Lab19.pdf
   • Lab20.pdf
   • Back to top