Monday, October 8, 2007

[cse 471] Proj-1 statistics, grading scheme and comments

Hi all,
 
Here are some details on project-1 evaluation:
 
Grade distribution:
 
Grad: 93.4
 (Avg)
100 (H)
74 (L)
 
 
 
 
 UG:  90.5
 (Avg)
 99 (H)
74 (L)
 
ExtraCredit:     UG (Highest - 14)   Grad (Highest - 40)
 
Grading Scheme:
 
Part-1  --  32 pts   ( 2+5+5+5+5+10 - for the tasks)
Part 2  --  36 pts  
     A* function - 10 pts
    1. Code to collect different statistics  -  (3+3+3+4+2) - 15 pts
    2. Print path  - 5 pts
 (efficiency + quality of code )  - 6 pts
 
Part 3 -- Analysis (32 pts)
      Correct runs for given 5 test cases with all heuristics and metrics  -- 10 pts
      Comparison of various heuristics / comments on trends in computed statistics -- 10 pts
      Other interesting findings, observations, exceptions and proposed improvements  -- 12 pts  
     
Extra Credit: (40 pts)
1. DFS  -- 5 pts
2. Weighted  F-function --  8 pts
3. Redundant ancestral removal  -- 7 pts
4. Pattern Database heuristic   -- 20 pts
 
Comments::
 
* Most of you did well (following all the instructions I had sent earlier) and submitted a good report with formatted code, implementation details and analysis of various methods and heuristics.
 
* 2 students completed all the extra credit problems. In fact, one of them additionally implemented 'pancake sorting' using A* search to test its working on problems with higher branching factor. You're highly encouraged to try such new things, especially to look for exceptions in the given methods/trends, and suggestions for improving the solutions etc.
 
* Some of you have to follow better coding practices.
   - A couple of students coded three different child generation functions (one for each heuristic) -- which is a very bad coding practice. You should write generalized functions.
   - And, hard coding the values should be avoided.
   - While printing results to the console, you should format the results properly. (ex: printing the path to goal node, some of you just printed the LISP representation of arrays)
 
Please let me know if you have any questions on grading.
 
Thanks,
Aravind

No comments: