Depth-first search
lastmod 2020-09-20created 2016-11-284 edits
Depth-first search (DFS) is a blind search method that selects the most recently added node of the search tree, applies one of the operators applicable to that node to add one child node at the next level of the tree, and repeats this process of adding child nodes until the added child node is the goal node.
Implementation
Depth-first search is easily implemented with a stack.