<p>More flexible control over the search process is provided by Search Combinators, which are described in the publication below. </p>

<p>Schrijvers, Tom, et al. "Search combinators." Principles and Practice of Constraint Programming–CP 2011. Springer Berlin Heidelberg, 2011. 774-788.
Online at <a href="http://arxiv.org/pdf/1203.1095.pdf" rel="nofollow">http://arxiv.org/pdf/1203.1095.pdf</a> </p>

<p>Some implementation exists for Gecode, see the bottom of <a href="http://www.gecode.org/flatzinc.html" rel="nofollow">Gecode's FlatZinc page</a></p>
Minizinc: variable order
<p>A constraint model may have restrictions or provide hints to the constraint solver to solve the problem more efficiently by defining the order in which variables are solved for. Is there a mechanism to specify the order in which variables need to solved in MiniZinc or FlatZinc ?</p>