CS 540 - Introduction to Artificial Intelligence Section 1 Fall 2019

CS 540 Homework Assignments

• General Information
  • Questions and answers related to homework assignments should be posted on the Piazza course web site.
  • Some Useful Java Links
  • Creating Makefiles Help
    EF="http://www.cs.wisc.edu/~dyer/cs540/handouts/ll/unixhelp/howto_makefiles.html#java">help1
    • help2
  • How to Hand In a Programming Assignment
  • Late Penalty Rule
  • Corrections to any grading must be resolved within one week after a homework is handed back.

• Homework #3: Neural Networks and SVMs (Due: Monday, March 12)
  • HW #3

• Homework #2: Search and Game Playing (Due: Wednesday, February 29)
  • HW #2
  • HW #2 Solutions to Written Problems
  • Checkers-ant.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
  • Grading Questions
    If you have any questions on the grading of your homework, please see the appropriate TA who graded the part in question:
    • Erin graded the written parts
    • Halit graded the programming part 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 given to the top players in the tournament. The tournament used 100 ms/move and 70 sec was used as a threshold to determine ties. There were 52 entries in the tournament, so each student's program played 51 others, for a maximum number of points of 306 (= 51 * 2 * 3).
    • Congratulations to the top programs:
      • 1st place (246 points): Dan Lancour
      • 2nd place (245 points): Jacob Webster
      • 3rd place (236 points): Sam Cedarbaum
    • Tournament results
  • 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
  • An online version of Minesweeper that uses CSP
  • Some games that are especially hard for computers to play well
    • Arimaa
    • Go
    • Try playing Go yourself

• Homework #1: Heuristic Search (Due: Wednesday, February 15)
  • HW #1
  • HW #1 Solutions
  • Test mazes
    • smallMaze.txt
      A possible solution: smallMazeSolution.txt
    • mediumMaze.txt
    • bigMaze.txt
      A possible solution: bigMazeSolution.txt
    • openMaze.txt
  • HW1.zip file contains provided skeletal code for your program
  • Instructions on how to get started using Eclipse for this assignment
  • Instructions for how to hand everything in electronically are given HERE
  • In order for the TA to easily compile and run your code with additional test cases during grading, you are asked to also submit a Makefile (even if you use Eclipse or some other development environment for creating your code). Your Makefile should be very basic; if you do not have experience creating Makefiles, see the example makefile.
  • Grading Questions
    Average score was 82.6, the high score was 100, the 90th percentile was 97, 80th percentile was 95, 70th percentile was 94, 60th percentile was 92.4, 50th percentile (median) was 91, 40th percentile was 85.6, 30th percentile was 82, and 20th percentile was 75.4 on HW #1.
    If you have any questions on the grading of your homework, please first see the appropriate TA who graded the part in question:
    • Erin graded the written parts (problems 1 and 2)
    • Halit graded the programming part (problem 3)