= Depth-first tree search
The <tree search> version of <depth-first search> follows one action history until it ends, then returns to another choice. Repeated states do not automatically stop a branch. An infinite branch can prevent discovery of a goal on a different finite branch, so this method is not generally a <complete search algorithm>. A finite <search tree> restores completeness, but the first successful history need not minimize cost or maximize a terminal reward.
Back to article page
