2.9 Search Order

So far we have not specified in which order search trees are explored. Although this order has no impact on the shape and size of a search tree, it does have an impact on the time and memory resources needed to find one or all solutions:

We will assume that the search engine explores the search trees always in a depth-first fashion. Moreover, when the engine distributes with a constraint C, it explores the space obtained with C first and the space obtained with \neg
C second.

The above assumptions ensure that the exploration of a search tree is a deterministic process, provided the distribution strategy generating the constraints to distribute with is deterministic.

Christian Schulte and Gert Smolka
Version 1.4.0 (20080702)