IBM ILOG Solver User's Manual > The Basics > Constraint Programming with IBM ILOG Solver > Solve > Search tree

After initial constraint propagation, the search space is greatly reduced. This remaining part of the search space, where Solver will use a search strategy to search for a solution, is called the search tree. The root of the tree is the starting point in the search for a solution; each branch descending from the root represents an alternative in the search. Figure 1.2 shows a graphic representation of the search tree for this problem.

intro_search_tree2.gif

Figure 1.2 Search tree