Lines Matching refs:choices
127 represent choices which partition the remaining search space into two
272 In general, the nodes of a search tree represent {\em choices}.
274 These choices should be mutually exclusive and therefore partition the
292 Other forms of choices are possible. If X2 is a variable that can take
302 However, choices do not necessarily involve choosing a concrete value
303 for a variable. It is also possible to make disjoint choices by
601 flag (deep\_fail) which ensures that backtracking to exhausted choices
774 nondeterministic choices is limited a priori. This is achieved by
779 are not allowed any nondeterministics choices, only one path though these
823 Note that this method in its pure form allows choices only close to the
824 root of the search tree, and disallows choices completely below a certain
945 The rationale for this is that heuristic choices typically get