Home * Search * Depth-First
300px-Depth-first-tree.svg.png

Depth-First refers to node traversal algorithms of tree like data structures like search trees. Depth-first examines child nodes before siblings and can easily implemented with recursion using a stack of nodes. It therefor has moderate memory requirements, since only one path from the root to a leaf is kept in memory, which grows proportional with search depth.
Depth-First Node order [1]

300px-Breadth-first-tree.svg.png

The depth-limited search, to make the depth-first search find a solution within the depth limit, is the most common search algorithm in computer chess, as described in minimax, alpha-beta and its enhancements. Iterative deepening is a state space search strategy in which a depth-limited search is run repeatedly, with a cumulative node order effectively breadth-first.
Breadth-First Node order [2]

See also


Publications


External Links


References

  1. ^ Depth-first search from Wikipedia
  2. ^ Breadth-first search from Wikipedia
  3. ^ Dovetailing (computer science) from Wikipedia

What links here?


Up one Level