Work

Depth-first iterative-deepening: An optimal admissible tree search