Not logged in. · Lost password · Register

jfschaefer
Member for 2 months
29 posts
Subject: Problem 3.2 - Remarks on Grading, Iterative Deepening
Dear all,

I've been asked during my tutorial yesterday whether it is acceptable that iterative deepening does not terminate if the goal node cannot be found.
Here is the grading policy we came up with:
- 10 points for DFS
- 20 points for each of the other three algorithms

If iterative deepening does not terminate if the goal node can't be found: 18 points.

I hope this clarifies things,
Frederik
Close Smaller – Larger + Reply to this post:
Verification code: VeriCode Please enter the word from the image into the text field below. (Type the letters only, lower case is okay.)
Smileys: :-) ;-) :-D :-p :blush: :cool: :rolleyes: :huh: :-/ <_< :-( :'( :#: :scared: 8-( :nuts: :-O
Special characters:
Go to forum
Datenschutz | Kontakt
Powered by the Unclassified NewsBoard software, 20150713-dev, © 2003-2011 by Yves Goergen