C17 - Otters - Doina and Taingleap

adagrams/game.py

@@ -1,11 +1,97 @@
+
+import random
+
+LETTER_POOL = {
+    'A': 9, 
+    'B': 2, 
+    'C': 2, 
+    'D': 4, 
+    'E': 12, 
+    'F': 2, 
+    'G': 3, 
+    'H': 2, 
+    'I': 9, 
+    'J': 1, 
+    'K': 1, 
+    'L': 4, 
+    'M': 2, 
+    'N': 6, 
+    'O': 8, 
+    'P': 2, 
+    'Q': 1, 
+    'R': 6, 
+    'S': 4, 
+    'T': 6, 
+    'U': 4, 
+    'V': 2, 
+    'W': 2, 
+    'X': 1, 
+    'Y': 2, 
+    'Z': 1
+}
+
 def draw_letters():
-    pass
+    letter_list = []
 
+    # Put every available letter in a list. If X is available N times, there will be N X's in the list
+    for key in LETTER_POOL:
+        letter_list += key * LETTER_POOL[key]
+
+    # shuffle the list
+    random.shuffle(letter_list)
+
+    # pick first 10 letters from the list
+    output = letter_list[:10]
+
+    return output
+
 def uses_available_letters(word, letter_bank):
-    pass
+
+    # convert word to uppercase for case insensitive operations
+    word_upper = word.upper()
+
+    # compare count of each letter in word with count of that letter in letter_bank
+    for letter in word_upper:
+        # If a letter appears more times in word than in letter_bank than return False
+        if word_upper.count(letter) > letter_bank.count(letter):
+            return False
+    return True
+
+SCORE_CHART = {'A': 1,'B': 3, 'C': 3, 'D': 2, 'E': 1, 'F': 4, 'G': 2, 'H': 4, 'I': 1, 'J': 8, 'K': 5, 'L': 1, 'M': 3, 'N': 1, 'O': 1, 'P': 3, 'Q': 10, 'R': 1, 'S': 1, 'T': 1, 'U': 1, 
+                'V': 4, 'W': 4, 'X': 8, 'Y': 4, 'Z': 10} 
 
 def score_word(word):
-    pass
+    score = 0
+
+    for letter in word.upper():
+        if letter in SCORE_CHART:
+            score += SCORE_CHART[letter]
+
+    # Add additional points if 7 <= length <=10
+    if 7 <= len(word) <= 10:
+        score += 8
+
+    return score
 
 def get_highest_word_score(word_list):
-    pass
+
+    # Initialize max_score and max_word variables to store the output 
+    max_score = 0
+    max_word = ""
+
+    for word in word_list:
+        # Call helper function "score_word" to calculate the score of each word
+        score = score_word(word)
+        # If the score is greater than current max_score, update max_score and max_word
+        if score > max_score:
+            max_score = score
+            max_word = word
+        # In case of tie in score, we will check the length of current word and current max_word
+        elif score == max_score:
+            # The current max_word value will be updated if the len(word) and  len(max_word) != 10 & len(word) is less than len(max_word)
+            if len(word) != 10 and len(max_word) != 10 and len(word) < len(max_word):
+                max_word = word
+            # The current max_word value will be updated if the len(word) == 10 and len(max_word) != 10  && len(word) is greater than len(max_word)
+            elif len(word) == 10 and len(max_word) != 10 and len(word) > len(max_word):
+                max_word = word
+    return max_word,max_score