Explanation: Hill-climbing search algorithm will have only current state in memory, So it is a online search algorithm. 7. Which search algorithm will use limited amount of memory?
A. RBFS (Recursive Best First Search)
B. SMA* (Simplified Memory Bounded A*)
C. Hill-climbing search algorithm
D. Both a & b
Answer:A
Explanation: Hill-climbing search algorithm will have only current state in memory, So it is a online search algorithm. 7. Which search algorithm will use limited amount of memory?
A. RBFS (Recursive Best First Search) B. SMA* (Simplified Memory Bounded A*) 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. 8. What is meant by simulated annealing in artificial intelligence?