Re: [eclipse-clp-users] Programming challenge (Re: constraint on indexed elements)

Joachim Schimpf wrote:
> Thorsten Winterer wrote:
> 
> 
>> In either of those cases
>> (no duplicates, or duplicates may be placed on each other) then *except
>> for the restriction of 12 boxes per stack*, this is the minimal chain
>> decomposition problem, for which an efficient algorithm is given in the
>> paper below.
> 
> Thanks for this hint!

Sorry, this was a cut&paste error - the hint was from
Matthew Scala of course!

I have clarified the problem statement on the web site,
and added a driver & solution checking program
http://eclipse-clp.org/examples/challenge.html


-- Joachim