Explanation: Constraints are propagated towards goal node, modifying actual problem. 6. Which search algorithm will use limited amount of memory?
A. RBFS
B. SMA*
C. Hill-climbing search algorithm
D. Both a & b
Answer:A
Explanation: Constraints are propagated towards goal node, modifying actual problem. 6. Which search algorithm will use limited amount of memory?
A. RBFS B. SMA* C. Hill-climbing search algorithm D. Both a & b
Explanation: RBFE and SMA* will solve any kind of problem that A* can’t by using limited amount of memory. 7. How many the new states are generated in backtracking algorithm?