General Info[]
What[]
A tree search algorithm is an algorithm that is capable of searching through data that is organized in a tree structure (obviously)
How[]
- Start with the root node in the fringe
- Expand by picking a node off the fringe and putting all its children on the fringe
- Repeat the process until the node we pick off the fringe is the goal state or there are no more nodes on the fringe
Important Ideas[]
- Fringe - the fringe is a list of nodes to explore
- Expansion - expansion is the process of adding all of a node's children to the fringe
- Exploration Strategy - the exploration strategy tells us which node to take off the fringe for consideration next
Algorithm[]
A pseudocode for the tree search algorithm.