Mostafa,
I don't know if you have noticed, but I've sent a message with the
following subject line "best-search example for Mostafa and curious
best-search method" and by "Mostafa" I meant you, by the way. There you'll
find an attachment with a complete example that must suit your needs. I
changed the subject line because in this attachment I also define a
different search method (at least one not in Mozart's library) which I
found curious and so I tried to attract other people's attention.
Cheers,
Jorge.
Raphael Collet escreveu:
> Mostafa,
>
> The cost itself is defined as a constrained variable. So you can impose
> constraints on it, like
>
> Cost =<: 5
>
> This constraint will fail in your second example.
>
> Cheers,
> raph
>
> mostafa eslahi wrote:
>>
>> It works!,Thanks Raphael,
>> Now, I have another question, I would be grathful if you could help me.
>> In this step, I need a constraint, something like cost function.
>> In detail, I have an alldiff{x(1),...,x(2n)} again with domains
>> [1..2*n].
>> Now, I want in any feasible solution, there are atmost m (e.g m=5)
>> consecutive values,
>> For example,for m=5 and n=10 a feasible solution is
>> {2,6,1,3,7,14,20,4,5,11}
>> but this is a infesible solution {2,6,8,3,7,14,20,4,5,11} (since number
>> of 2,3,4,5,6,7,8 is seven).
>> I have some idea, but none of them works.
>> How can I impse it?
>> Cheers,
>
> _________________________________________________________________________________
> mozart-users mailing list
> [email protected]
> http://www.mozart-oz.org/mailman/listinfo/mozart-users
>
Jorge M. Pelizzoni
ICMC - Universidade de São Paulo
_________________________________________________________________________________
mozart-users mailing list
[email protected]
http://www.mozart-oz.org/mailman/listinfo/mozart-users
