[gecode-users] Detecting a complete problem

[Malcolm Ryan]

How does Gecode/J decide that a problem is complete? I've just tried  
running Gist on a problem and it stopped at the root node and said it  
was solved, even though many variables were still unbound.

E.g:

public class Test1 extends Space {

     private VarArray<IntVar> vars;

     public Test1() {
         super();
         IntVar a = new IntVar(this, 1, 3);

         vars = new VarArray<IntVar>();
         vars.add(a);
         Gecode.branch(this, vars, BvarSel.BVAR_DEGREE_MIN,  
BvalSel.BVAL_MIN);
     }

     public Test1(Boolean share, Test1 old) {
         vars = new VarArray<IntVar>(this, share, old.vars);
     }

     public String toString() {
         return vars.toString();
     }

     public static void main(String[] args) {
         Test1 test1 = new Test1();

         Gist gist = new Gist(test1);
     }
}

--
"The modern man in revolt has become
           practically useless for all purposes of revolt.
By rebelling against everything
           he has lost his right to rebel against anything."
                                                    - G.K.Chesterton,  
Orthodoxy