|No such thing as a small change|
Wordfeud racksby Anonymous Monk
|on Jul 30, 2013 at 11:51 UTC||Need Help??|
Anonymous Monk has asked for the
wisdom of the Perl Monks concerning the following question:
you all know of wordgames like Wordfeud and Scrabble. At the very beginning of such a game there is a bag full of tiles. In English Wordfeud for example there are 10 A:s, 2 B:s etc.
Now - how to list all possible racks in the initial stage? A rack consists of 7 tiles, and the order of the tiles at hand are of course of no importance.
And, additionally compute the probability of each rack.Something like this
To list the possible racks I have already looked at some CPAN modules, but most modules seems to handle only cases where there is only one element of each kind in the set from which to draw. The one I found that could handle this Math::Combinatorics was so ridicilously slow it would probably take days or even weeks to generate the list!So now I turn to thee, monks, for spiritual Perl advice.