[gecode-users] n-ary branching

[Marco Correia]

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>