Submission Instructions for Project 1

[Subbarao Kambhampati <rao@asu.edu>]

Project Submission instructions:

 

1.    Please submit at class-time, Tuesday, Sep 30, 2003

 

2.    Written analysis as described in Part III of the
project. Please be precise and to the point.  You can write:

o   Your observations on the performance of the three search
algorithms ? based on time, variations with the goal depth etc (see part
III)

 

3.    Hardcopy of your Lisp code

 

4.    SUCCINCT dribble of the 15 test case runs from Part
III

   5 test cases x 3 search algorithms = 15 test cases in all.

   Note: This will be exercising the code you developed in
parts I & II

         and should therefore
also demonstrate all the features    

         requested there. No
other submittal on Parts I & II is needed.

 

5.    Turn OFF any excessive trace printing you may have
implemented so as

   to avoid HUGE dribble files.  Please: 

o   Do NOT print/submit dribble files with numerous
false-starts and debugging episodes.  

o   DO submit concise output showing the requested statistics
such as Nodes generated, nodes expanded, average and effective branching
factors, depth of the goal, path to the goal node (see Part III) for each
of the 15 cases.

o   For the Analysis report as well as Lisp code use fonts
lower than size 11 (preferably Times Roman 9 0r 10) and single spaced if
you are using Word or similar format with other Word processors. DO NOT
MAKE THE PROJECT BULKY WITH TOO MUCH SPACING AND BIG FONTS 

 

6.    E-mail your lisp SOURCE files for Part 1 and II as
well as any  

   extra credit (NOT the .fasl file) to me at  

   lakshmi@sagarmatha.eas.asu.edu   by Sep 30,
2003 the end of day. 

 

Tentative Grading distribution: (125 points)

 

Part 1: (10 points)

Gather 5 Statistics:   10

 

Part 2: (60 points)

Task 1 data structure for holding the 8-puzzle state: 5

Task 2 generating 8-puzzle states: 10

Task 3 goal-test function: 5

Task 4 heuristic functions: 10

Task 5 children generator function: 5

Overall A* implementation combining all above functions: 15

 

Part 3: Test case Running (30 points)

1. breadth-first (A* with h=0): 10

2. A* with h= misplaced tiles :10

3. A* with h= manhattan distance: 10

 

Analysis Report: (25 points)

Comparison/Analysis of performance: 10

Comparison tables: 5

Relating Experimental results to the theory discussed in class and your
understanding: 10

 

EXTRA CREDIT: (65 points)

 

Task 1- 15 points, task 2 ? 15 points, task 3 ? 15 points, task 4 ? 20
points

 

Make sure you submit the code, analysis and test cases for the extra
credit tasks too.