Which search algorithm will use a limited amount of memory in online search?

by

RBFE and SMA* will solve any kind of problem that A* can’t by using a limited amount of memory.

The correct answer would be the “Iterative Deepening Depth-First Search (IDDFS)” algorithm.

IDDFS combines the benefits of Breadth-First Search (BFS) and Depth-First Search (DFS) by using a depth-first search approach but with a limited depth for each iteration. This allows it to consume a limited amount of memory while still exploring the search space effectively. By gradually increasing the depth limit in each iteration, IDDFS can eventually find the solution if it exists within the search space. This makes it suitable for online search scenarios where memory usage needs to be controlled.