Exam (elaborations)
CMSC421: Midterm 1(All accurately solved)
- Course
- Institution
T/F: "A* tree search is not complete if some step costs are equal to zero." correct answers False. If we have finite number of states and avoid cycles/loops, it will be complete. (Me: OHHH I think that it will complete, but it might not be Optimal bc we haven't said anything about whether the he...
[Show more]