Question

I'm working on problem set #6, the one with the scrabble-like word game. I'm trying to figure out how to define a function that will provide all the subsets (or sub-multisets) within a hand. I suspect I should be able to write a recursive function for it, but I'm stumped. Where to turn?

Answer 1

i found the itertools module in the standard library useful
http://docs.python.org/library/itertools.html#itertools.permutations
http://docs.python.org/library/itertools.html#itertools.combinations

Answer 2

Yes, I was searching for advice on permutations and found this also. It will do what I need, but it seems like it would be more beneficial to learn to you write a function myself.

Answer 3

nested loops? one for each character position?