= Tree search
A <search algorithm> that explores action histories in a <search tree>. Two histories ending in the same state remain distinct nodes unless an additional repetition rule identifies them. Consequently a finite <state space> can generate an infinite <search tree>: a legal stay action at a nonterminal state already suffices. A <graph search> instead records explored states to control repetitions. Confusing these models changes termination and completeness claims.
Back to article page
