Kunzite - Abby Castillo #126
Conversation
|
|
||
| def score_word(word): | ||
| pass | ||
| score = 0 |
There was a problem hiding this comment.
Nice job here, this will score the word according to the letter to point value mapping, however the requirements for Wave 03 also state: "If the length of the word is 7, 8, 9, or 10, then the word gets an additional 8 points", which this function doesn't account for.
|
|
||
| import random | ||
|
|
||
| LETTERS_TUPLE = ( {'A': 9, |
There was a problem hiding this comment.
Interesting choice of data structure! Since in the next line of you index this nested dictionary out of the tuple, it's not clear why the nesting in the first place - you could use a dictionary and bypass the need to index a tuple!
|
|
||
| # helper functions | ||
|
|
||
| def make_letter_pool_list(letter_frequencies): |
There was a problem hiding this comment.
Cool helper function, this will help ensure the letter pool distribution is accounted for!
|
|
||
| def uses_available_letters(word, letter_bank): | ||
| pass | ||
| hand = list(letter_bank) |
There was a problem hiding this comment.
letter_bank is already a list, so no need to convert to a list.
| if letter not in hand: | ||
| return False | ||
| elif letter in hand: | ||
| hand.remove(letter) |
There was a problem hiding this comment.
No need to remove the letter from the hand on this implementation. All you're concerned with is checking whether the letter is not in the hand. If you iterate over all the letters and find that all of them are in the hand, you can just return True.
No description provided.