a) 1
b) 2
c) 3
d) 4
Answer: a
Explanation: Each partially expanded node remembers which successor to generate next because of these conditions, it uses less memory.
Related Posts
When is breadth-first search is optimal?
How many types are available in uninformed search method?
Which search is implemented with an empty first-in-first-out queue?
Which search strategy is also called as blind search?
Which is the best way to go for Game playing problem?
Which search method takes less memory?
A production rule consists of ____________
Join The Discussion