[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[Chicken-users] Re: Chase's Sequence
From: |
Kon Lovett |
Subject: |
[Chicken-users] Re: Chase's Sequence |
Date: |
Sun, 20 Jan 2008 10:11:56 -0800 |
To whom it may concern,
Sorry for taking so long to reply to the queries.
I have updated the wiki entry to reflect a better separation of
concerns - the basic algorithm vs. index swapping. An example is
included.
The algorithm generates the length r combinations for a set of n
elements.
A bit-set indicates which elements are in the current combination.
Note that the algorithm generates the combinations, not the
permutations! In a permutation order is important - {1 2 3} is not {3
2 1} but they are equivalent combinations. So '(make-chase-sequence
52 5)' will generate all possible card "hands".
See http://en.wikipedia.org/wiki/Combination
Best Wishes,
Kon
[Prev in Thread] |
Current Thread |
[Next in Thread] |
- [Chicken-users] Re: Chase's Sequence,
Kon Lovett <=