Which search algorithm will use limited amount of memory?ans.RBFSBoth RBFS & SMA*SMA*Hill-climbing search algorithm

The search algorithm that uses a limited amount of memory is the Simplified Memory-Bounded A* (SMA*) algorithm.

Here's a step-by-step explanation:

1. The SMA* algorithm is a variant of the A* search algorithm. It is designed to function efficiently with a limited amount of memory.

2. The A* algorithm is a popular choice for pathfinding and graph traversal, which is the process of visiting and exploring every node in a graph. However, it can consume a lot of memory, especially when dealing with large graphs.

3. To overcome this, the SMA* algorithm was developed. It keeps track of the best path it has found so far and discards the worst paths when memory is full.

4. If the algorithm needs to revisit a discarded path, it recreates the path from the stored best path. This way, it can operate within a fixed amount of memory.

5. The Recursive Best-First Search (RBFS) algorithm also uses a limited amount of memory, but it is not as efficient as SMA* in terms of memory usage.

6. The Hill-Climbing search algorithm is a local search algorithm and it also uses a limited amount of memory. However, it can get stuck at local maxima or minima.

So, the answer to your question is the SMA* algorithm.