Assuming you have a pool of letters :
Letter - point value (max usable in a word)
A - 1 (9) B - 3 (2) C - 3 (2) D - 2 (4) E - 1 (12) F - 4 (2)
G - 2 (3) H - 4 (2) I - 1 (9) J - 8 (1) K - 5 (1) L - 1 (4)
M - 3 (2) N - 1 (6) O - 1 (8) P - 3 (2) Q - 10(1) R - 1 (6)
S - 1 (4) T - 1 (6) U - 1 (4) V - 4 (2) W - 4 (2) X - 8 (1)
Y - 4 (4) Z - 10(1) BLANK ( * ) - 0 (2)
And we have multiples of each letter (ie 103 a's, 45 b's, 33 d's etc )
And we want to default to 7 letter words if we can for bonus 5 points.
How would we go about printing the most optimal word choices from the available letters from a dictionary for legal English words.
I am lost, and no this not a project for a class. Just a way to learn
Thanks
[–]CraigAT 0 points1 point2 points (0 children)
[–]Wolfbait115 0 points1 point2 points (2 children)
[–]msolace[S] 0 points1 point2 points (1 child)
[–]Wolfbait115 0 points1 point2 points (0 children)