CS 540 - Introduction to Artificial Intelligence Fall 2009

CS 540 Homework Assignments

• General Information
  • Frequently-asked questions (FAQs) on homework assignments will be e-mailed to the class alias, compsci540-1-f09@lists.wisc.edu.
  • How to Hand In a Programming Assignment (NOTE: All documents handed in should be STAPLED together -- NO LOOSE SHEETS!, and should include a cover sheet on top which includes your name, login, class title, HW #, date, and, if late, how many days late it is)
  • Late Penalty Rule
  • Corrections of any grading problems must be resolved within one week after a homework is handed back.

• Homework #4: Neural Networks and SVMs (Due: Wednesday, November 25)
  • HW #4 (updated 11/19/09)
  • Question 4 data file: Q4.txt

• Homework #3: Logic, Inference and CSP (Due: Wednesday, November 11)
  • HW #3
  • HW #3 Solution
  • An online version of Minesweeper that uses CSP

• Homework #2: Search and Game Playing (Due: Wednesday, October 14)
  • HW #2 (updated 10/2/09)
  • Checkers-hw.tar tar file containing provided code -- use if you use Ant to build
  • Checkers-eclipse.tar tar file containing provided code -- use if you use Eclipse to build
  • Documentation of provided code
  • Documentation on using Eclipse to build (updated 10/5/09)
  • HW#2 Solutions to Written Problems
  • Grading Questions
    If you have any questions on the grading of your homework, please the appropriate TA who graded the part in question:
    • Shengnan Wang graded the written parts
    • Zhiting Xu graded the alpha beta players
    • Mark Chapman graded the competitive players and ran the tournament
  • Class tournament
    There will be a class tournament using the tournament player you write. It will be run by the TAs after the due date. Each entrant will play every other entrant twice, once going first (red) and once going second (black). A win is worth 3 points, a tie 1 point, and a loss 0 points. Extra credit points and PRIZES will be awarded to the top places in the tournament.
    • Congratulations to the top programs:
      • 1st place: Fei Du
      • 2nd place: Jennifer Losaw
      • 3rd place: Mark Omernick
    • Tournament results (2000 ms/move)
  • Links on Checkers
  • A. Samuel's famous paper Some studies in machine learning using the game of checkers. II - Recent progress, IBM Research Journal 11(6), 1967, 601-618.
  • A neural network for playing Checkers
  • Some games that are especially hard for computers to play well
    • Arimaa
    • Go
    • Try playing Go yourself

• Homework #1: Decision Trees (Due: Wednesday, September 30)
  • HW #1
  • Datasets for training, tuning, and testing:
    • train.txt
    • tune.txt
    • test.txt
  • Solution to the written part: HW #1 Written Solutions
  • Hand in typed or neatly printed answers to questions 1 and 2, plus the report for question 3. Hand in the source code electronically.

• Java References:
  • The Java Tutorials (Sun)
  • Some Java Tips
  • Information on File I/O
    • Reading and Writing
    • Word-Count
    • TextFileReadApp