IDA* Limitations
If f is not monotonic, IDA* no longer expands
nodes in best-first order
When searching nodes with f-values less
than current threshold, search procedes
depth-first.
f-values of such nodes are ignored in search
ordering
Example: Fig. 2 tree fragment
Other major limitation: many distinctive f-
values much re-expansion