For Programmers: Free Programming Magazines  


Home > Archive > Prolog > April 2005 > Re: list with all the combinations of the initial list elements









You are viewing an archived Text-only version of the thread. To view this thread in it's original format and/or if you want to reply to this thread please [click here]

 

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

2005-04-01, 8:57 am


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.

Sponsored Links







Also available: Server administration forum archive | Web Design forum archive | Software forum archive | Hardware reviews archive

Copyright 2008 codecomments.com