Re: list with all the combinations of the initial list elements

Bogdan wrote:
> Thanks you, your answer is good for me.
>        But there is another problem,
>        If I have for exemple une liste with 20 elements is OK, Prolog
> finds 524288 combinations. But if I want more elements, 21 for
> exemple, and I make a findall, the limit global memory (128 Mb) for
> SWI Prolog, is not enough.
> So, do you know a solution for this problem, or there is another
> version with a  bigger memory??? I have need to work with much more
> elements.
>
> Thanks you

Hello,

In a previuos post in this group, called "Problem" (18/12/2004), the
same combinatorial problem was analized. One of the proposed algorithms
provides the solutions one by one, instead of store all them in a list.
That could reduce memory requirements.

Kind regards.