Depth-First

toc =See also=
 * Home * Search * Depth-First**
 * [[image:300px-Depth-first-tree.svg.png link="http://en.wikipedia.org/wiki/Depth-first_search"]] ||~ || **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 ||~ ||^ ||
 * [[image:300px-Breadth-first-tree.svg.png link="http://en.wikipedia.org/wiki/Breadth-first_search"]] ||~ || 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 ||~ ||^ ||
 * Alpha-Beta
 * Backtracking
 * Best-First
 * Iterative Deepening
 * Minimax
 * Proof-Number Search

=Publications=
 * Richard Korf (**1985**). //Depth-first Iterative-Deepening: An Optimal Admissible Tree Search//. [|pdf] from [|CiteSeerX]
 * Stephen F. Wheeler (**1985**). //[|A performance benchmark of the alpha-beta procedure on randomly ordered non-uniform depth-first game-trees generated by a chess program]//. M.Sc. thesis, [|East Texas State University]
 * Hermann Kaindl, Helmut Horacek, Marcus Wagner (**1986**). //Selective Search versus Brute Force.// ICCA Journal, Vol. 9, No. 3
 * Steven Skiena (**1990**). //Breadth-First and Depth-First Search.// §3.2.5 in [|Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica]. Reading, MA: Addison-Wesley, pp. 95-97,
 * Weixiong Zhang, Richard Korf (**1993**). //[|Depth-first vs. best-first search: New results]//. [|AAAI'93]
 * Matthew L. Ginsberg (**1993**). //[|Essentials of artificial intelligence]//. [|Morgan Kaufmann Publishers], ISBN13: 9781558602212, 3.2 Depth-First Search
 * Ayumu Nagai, Hiroshi Imai (**1999**). //Proof for the Equivalence Between Some Best-First Algorithms and Depth-First Algorithms for AND/OR Trees//. Proceedings of the Korea-Japan Joint Workshop on Algorithms and Computation
 * Ayumu Nagai, Hiroshi Imai (**2002**). //[|Proof for the Equivalence Between Some Best-First Algorithms and Depth-First Algorithms for AND/OR Trees]//. [|IEICE transactions on information and systems]
 * Tomoyuki Kaneko (**2010**). //Parallel Depth First Proof Number Search//. [|AAAI 2010] » Parallel Search, Proof-number Search
 * Kunihito Hoki, Tomoyuki Kaneko, Akihiro Kishimoto, Takeshi Ito (**2013**). //Parallel Dovetailing and its Application to Depth-First Proof-Number Search//. ICGA Journal, Vol. 36, No. 1

=External Links= > media type="youtube" key="NpQnmYP4aT8" width="560"
 * [|Depth-first search from Wikipedia]
 * [|Depth-limited search from Wikipedia]
 * [|Iterative deepening depth-first search from Wikipedia]
 * [|Depth-First Traversal] from [|Wolfram MathWorld]
 * [|Boost Graph Library: Depth-First Search]
 * [|depth-first search] from [|Dictionary of Algorithms and Data Structures] by [|Paul E. Black], [|National Institute of Standards and Technology]
 * Flat Earth Society & [|Ernst Reijseger] - Down Deep, [|Jazz Middelheim] 2012, [|YouTube] Video

=References= =What links here?= include page="Depth-First" component="backlinks" limit="60"
 * Up one Level**