Search depth 1, then 2, then 3... Each iteration re-searches from the root but goes one level deeper.
Combines DFS memory efficiency with BFS completeness.
At each depth, the best move so far is used for move ordering in the next iteration.
Current depth: 0
Nodes: 0
Best move: --