Iterative Deepening Branch and Bound

S. Mohanty, R. N. Behera

In tree search problem the best-first search algorithm needs too much of space . To remove such drawbacks of these algorithms the IDA* was developed which is both space and time co…