diff --git a/adagrams/game.py b/adagrams/game.py
index 5fb37b11..a13e772d 100644
--- a/adagrams/game.py
+++ b/adagrams/game.py
@@ -1,11 +1,119 @@
+"""Adagrams: It's really scrabble"""
+
+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
+}
+
+letter_value = {
+    1: ['A', 'E', 'I', 'O', 'U', 'L', 'N', 'R', 'S', 'T'],
+    2: ['D', 'G'],
+    3: ['B', 'C', 'M', 'P'],
+    4: ['F', 'H', 'V', 'W', 'Y'],
+    5: ['K'],
+    8: ['J', 'X'],
+    10: ['Q', 'Z']
+}
+
+
 def draw_letters():
-    pass
+    """Output a list of ten strings, where each string is a letter of 
+    len(1) as defined in LETTER_POOL."""
+
+    letter_pool_copy = LETTER_POOL.copy()
+    letters = []
+
+    while len(letters) < 10:
+        letter_key = random.choice(list(letter_pool_copy.keys()))
+        if letter_pool_copy[letter_key] != 0:
+            letter_pool_copy[letter_key] -= 1
+            letters.append(letter_key)
+
+    return letters
+
 
 def uses_available_letters(word, letter_bank):
-    pass
+    """Each letter in the word 1) is not case-sensitive and 2) is not 
+    utilized more than the available frequency outlined in LETTER_POOL."""
+
+    letter_bank_copy = letter_bank.copy()
+    letter_bank_case = [element.upper() for element in letter_bank_copy]
+
+    for letter in word.upper():
+        letter.upper()
+        if letter in letter_bank_case:
+            letter_bank_case.remove(letter)
+        else:
+            return False
+
+    return True
+
 
 def score_word(word):
-    pass
+    """Assign point value to the word as outlined in letter_value."""
+
+    current_score = 0
+    for letter in word:
+        letter = letter.upper()
+        for key, val in letter_value.items():
+            if letter in val:
+                current_score += key
+    if 6 < len(word) <= 10:
+        current_score += 8
+
+    return current_score
+
 
 def get_highest_word_score(word_list):
-    pass
\ No newline at end of file
+    """Return the highest scoring word. For ties: the first
+    10-letter word wins. If there are no 10-letter words, the 
+    shortest word wins."""
+
+    highest_score = 0
+    winning_word = ""
+
+    for word in word_list:
+        score = score_word(word)
+        print(f'word: {word}, score: {score}')
+        if score > highest_score:
+            if len(word) == 10:
+                highest_score = score
+                winning_word = word
+            elif len(word) < 10 and len(winning_word) != 10:
+                highest_score = score
+                winning_word = word
+        elif score == highest_score:
+            if len(word) == 10 and len(winning_word) != 10:
+                highest_score = score
+                winning_word = word
+            elif len(winning_word) != 10 and len(word) < 10 and len(word) < len(winning_word):
+                highest_score = score
+                winning_word = word
+
+    return (winning_word, highest_score)