Assignment 2 information

• The AI web tester will not be up in time for Assignment 2. Please turn in the appropriate parts of this assignment electronically via the method described below. Unfortunately, this does not test your code; we'll run tests on it next week and email the transcripts to you.
  • Your scheme code for all functions that are to be turned in electronically (including any helper functions they need to run, of course) should be in a single file. Please see items below on what functions should be in your file and what should be turned in on paper.

  • Name this file using your RCS username and the extension ".scm". For example, if President Shirley Jackson were taking this class and her RCS email address is jackss@rpi.edu, then she would name her file jackss.scm

  • Copy or ftp your file to the directory /dept/cs/ai/submit2 You will only have permission to copy a file into this directory and to list the contents of this directory. You cannot read, modify, or delete files in this directory.

    You cannot do this from the newer CS machines because they do not have AFS. You can however, do it from the older machines such as dishwasher. You will have to klog -cell rpi.edu and then copy your file to /afs/rpi.edu/dept/cs/ai/submit2.

  • Note that you can do this from Windows as well as UNIX systems. On windows systems, click on the desktop RCS icon and connect to the public areas. You'll have to type your RCS username and password. Then open the "dept", "cs", and "ai" folders.

  • If for some reason you need to resumbit your assignment, add an extension ".1" when you sumbit your revised solutions. For example, if Dr. Jackson had to resumbit her assignment, she would name the new file jackss.scm.1 If for some reason you need to sumbit the assignment again, increment the number of the final extension (e.g. jackss.scm.2, etc.)

  • We will only grade the most recent sumbission.

  • You are to turn in the following on paper in class on Friday:
    • Answers to 4c
      • How many nodes are evaluated in order to find a solution to the 6 queens problem? the 8 queens problem?
    • Answers to 5b:
      • A printout of your rr-bfs procedure (and associated helper function(s)
      • Answers to the questions: How many nodes are evaluated in order to find a solution [to the missionaries and cannibals problem using your rr-bfs function]?

  • Regardless of the exact method of electronic turn in, you are to turn in the following functions (and any associated helper functions) electronically:
    • mag
    • positions
    • positions-list
    • swap
    • nq-valid?
    • nq-child-states
    • remove-repeat
    • permute

  • DO NOT include my code (i.e. the a2code.scm file) in your solutions. This just makes your file bigger and is unnecessary. The testing program will automatically load this file, so you do not need to.

    However, it is OK if you load the file, and this is the way I recommend writing your file for the assignment: put the command (load "a2code.scm") in the beginning of your file. (This assumes that when you have copied the file to the same directory as your scheme code.)

  • The code you need for Assignment 2 is here. (Includes code for the N queens problem, breadth first search, and the missionaries and cannibals problem.)
  whuang@cs.rpi.edu; email
  Last updates: September 14; September 13; September 11, 2000