Project 3 - Planning

Section 1 - Functionality - 30 Points

1. Default Search procedure (BFS/DFS) - 5
2. Plan Retrieval
• Complete plan - 5
• Partial plans - 5
3. Plan Failure
• Add failures - 2
• Learn from failure - 5
• Replan around failures - 5
• Simulate world - 3

Section 2 - Style - 20 pts

1. Style (Comments, Functional Organization, Easy to follow code) - 10 
2. Quality - Running, Compiling, Usage, Runtime errors etc - 10
   

Section 3 - Tests - 20 pts

• Plan a new path not in memory - 2
• (10th Hemphill) (Ferst-1 Atlantic) -
• (Ferst-1 Atlantic) (Ferst-2 Ferst-3) -
• (10th Atlantic) (10th Tech-Parkway)
• (10th Tech-Parkay) (Curran 6th-1)
  
• (Ferst-2 Ferst-3) (North Cherry) -
• (North Cherry) (Williams 3rd) -
  
• Retrieve complete plan - 3
• (10th Hemphill) (Ferst-1 Atlantic)
  
• Retrieve partial plan - no complete solution - 3
• (10th Hemphill) (Techwood 4th)
  
• Retrieve partial plan - complete solution - 4
• (10th Hemphill) (Williams 3rd)
  
• Normal add failure sequence - 2
• (add-failure (Fowler-1 10th) (10th Atlantic))
• (Fowler-1 10th) (10th Atlantic)
• (Tech-Parkway 10th) (10th Fowler-1)
  
• Add failure to a plan already in memory - 2
• (add-failure (3rd Fowler-2) (4th fowler-2))
• (add-failure (3rd Brittany) (4th Brittany))
• (add-failure (3rd Techwood) (4th Techwood))
• (add-failure (North Williams) (3rd Williams))
• (add-failure (3rd Fowler-2) (Cherry 3rd))
• (add-failure (ferst-2 ferst-1) (ferst-2 ferst-3))
• (10th Hemphill) (Williams 3rd)
• Infinite Looping test -  (-4 if failure joint with fail tests)
• (add-failure (North Techwood) (3rd Techwood))
• (10th Hemphill) (Williams 3rd)
  

Section 4 - Writeup - 30 pts

1. Program output from test cases - 5
2. Print out of plan memory - 5
3. Critique with data - 5
4. Failure test cases - 5
5. Critique of failures (part 2 - issues) - 5
6. Analysis of failure recovery & efficiency - 5
   

Section 5 - Bonuses

• Dijkstra's algorithm implementation for searching +2
• A* algorithm implementation for searching +2