[gecode-users] n-ary branching

[Christian Schulte]

It's in the trunk already, called INT_VALUES_MIN or INT_VALUES_MAX.

Christian

--
Christian Schulte, www.ict.kth.se/~cschulte/

-----Original Message-----
From: users-bounces at gecode.org [mailto:users-bounces at gecode.org] On Behalf
Of Marco Correia
Sent: Friday, December 05, 2008 4:05 PM
To: users at gecode.org
Subject: [gecode-users] n-ary branching

Hi!

>From what I understood so far, 

branch(this, q, INT_VAR_NONE, INT_VAL_MIN);

creates a binary search tree. 

Is there an easy way to create an n-ary search tree instead? I mean, once it

picks a variable, it branches on all of its values and only then goes to the

next. I know that binary branching is better in general, but I still would 
like to make it n-ary. I could try messing around with 

gecode/int/branch/select-val.icc

but it didn't went well last time :)

Thanks!
Marco

-- 
Marco Correia <mvc at di.fct.unl.pt>

_______________________________________________
Gecode users mailing list
users at gecode.org
https://www.gecode.org/mailman/listinfo/gecode-users