Implement iterative deepening
tavianator opened this issue · 1 comments
tavianator commented
Iterative deepening search has optimal runtime like BFS and optimal memory use like DFS, at the cost of many re-traversals of the nodes near the top of the tree.
Depends on #44.
tavianator commented
Implemented by ecb0f56