[gecode-users] Detecting a complete problem

[Malcolm Ryan]

On 20/11/2007, at 6:13 PM, Malcolm Ryan wrote:
> 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.

Aha, I found the problem. There's a missing line in the copy  
constructor:

>      public Test1(Boolean share, Test1 old) {
	
	super(share, old);

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

Malcolm

--
      "Progress should mean that we are always changing the world to fit
       the vision, instead we are always changing the vision."
                - G.K.Chesterton, Orthodoxy