Home > AI Searching Techniques > Depth First Search

Depth First Search

Depth First Search

Depth First Search

Formally, DFS is an uninformed search that progresses by expanding the first child node of the search tree that appears and thus going deeper and deeper until a goal node is found, or until it hits a node that has no children. Then the search backtracks, returning to the most recent node it has not finished exploring. In a non-recursive implementation, all freshly expanded nodes are added to a stack for exploration.

  1. No comments yet.
  1. No trackbacks yet.