diff --git a/README.md b/README.md
index 6a066368..200c3d74 100644
--- a/README.md
+++ b/README.md
@@ -1,5 +1,5 @@
 # AdaGrams
-
+Snow Leopards - Aria & Anika
 ## Skills Assessed
 
 - Following directions and reading comprehension
diff --git a/adagrams/game.py b/adagrams/game.py
index 5fb37b11..d6c163e9 100644
--- a/adagrams/game.py
+++ b/adagrams/game.py
@@ -1,11 +1,174 @@
+import random
+
+LETTER_POOL_W_VALUES = {
+    'A': {
+        'qty': 9, 
+        'value': 1
+    },
+    'B': {
+        'qty': 2,
+        'value': 3
+    },
+    'C': {
+        'qty': 2, 
+        'value': 3
+    },
+    'D': {
+        'qty': 4, 
+        'value': 2
+    },
+    'E': {
+        'qty': 12,
+        'value': 1
+    },
+    'F': {
+        'qty': 2, 
+        'value': 4
+    },
+    'G': {
+        'qty': 3, 
+        'value': 2
+    },
+    'H': {
+        'qty': 2, 
+        'value': 4
+    },
+    'I': {
+        'qty': 9,
+        'value' :1
+    },
+    'J': {
+        'qty': 1, 
+        'value': 8
+    },
+    'K': {
+        'qty': 1, 
+        'value': 5
+    },
+    'L': {
+        'qty': 4, 
+        'value': 1
+    },
+    'M': {
+        'qty': 2, 
+        'value': 3
+    },
+    'N': {
+        'qty': 6, 
+        'value': 1
+    },
+    'O': {
+        'qty': 8,
+        'value': 1
+    },
+    'P': {
+        'qty': 2, 
+        'value': 3
+    },
+    'Q': {
+        'qty': 1, 
+        'value': 10
+    },
+    'R': {
+        'qty': 6,
+        'value': 1
+    },
+    'S': {
+        'qty': 4, 
+        'value': 1
+    },
+    'T': {
+        'qty': 6, 
+        'value': 1
+    },
+    'U': {
+        'qty': 4, 
+        'value': 1
+    },
+    'V': {
+        'qty': 2, 
+        'value': 4
+    },
+    'W': {
+        'qty': 2, 
+        'value': 4
+    },
+    'X': {
+        'qty': 1, 
+        'value': 8
+    },
+    'Y': {
+        'qty': 2, 
+        'value': 4
+    },
+    'Z': {
+        'qty': 1,
+        'value': 10
+    }
+}
+
 def draw_letters():
-    pass
+    letters = []
+    frequency_of_letters = []
+    for letter, frequency in LETTER_POOL_W_VALUES.items():
+        letters.append(letter)
+        frequency_of_letters.append(frequency['qty'])
+    # random.sample returns a new list containing elements from the population
+    # while leaving the original population unchanged. counts controls the
+    # probability of an element within the sample. in this case, the greater
+    # the quantity of tiles for a letter, the higher probability that letter
+    # will be part of the random sample.
+    random_letters_list = random.sample(letters, counts =\
+        frequency_of_letters, k = 10)
+    return random_letters_list
 
 def uses_available_letters(word, letter_bank):
-    pass
+    copy_letter_bank = letter_bank.copy()
+    for letter in word.upper():
+        if letter not in copy_letter_bank:
+            return False
+        else: 
+            copy_letter_bank.remove(letter)
+    return True
 
 def score_word(word):
-    pass
+    score = 0
+    for letter in word.upper():
+        for k, v in LETTER_POOL_W_VALUES.items():
+            if k == letter:
+                score += v["value"]
+    if 6 < len(word) < 11:
+        score += 8
+    return score
 
 def get_highest_word_score(word_list):
-    pass
\ No newline at end of file
+    # list to store tuples
+    word_tuple_list = []
+    # make a tuple with word, score and length
+    # append the tuple to word_tuple_list
+    for word in word_list:
+        score = score_word(word)
+        length = len(word)
+        word_tuple = (word, score, length)
+        word_tuple_list.append(word_tuple)
+    
+    highest_score_tuple = word_tuple_list[0]
+    highest_score = word_tuple_list[0][1]
+    
+    # element[1] is score in each tuple
+    # element[2] is len of each word in each tuple
+    for element in word_tuple_list:
+        # element has score higher than current highest score
+        if element[1] > highest_score:
+            highest_score = element[1]
+            highest_score_tuple = element
+        # tie breaker
+        elif element[1] == highest_score:
+            if element[2] == 10 or highest_score_tuple[2] == 10:
+                if highest_score_tuple[2] == 10:
+                    continue
+                else:
+                    highest_score_tuple = element
+            elif element[2] < highest_score_tuple[2]:
+                highest_score_tuple = element    
+    return highest_score_tuple
\ No newline at end of file
diff --git a/tests/test_wave_03.py b/tests/test_wave_03.py
index 5473db39..396ea3a2 100644
--- a/tests/test_wave_03.py
+++ b/tests/test_wave_03.py
@@ -2,22 +2,26 @@
 
 from adagrams.game import score_word
 
+# @pytest.mark.skip
 def test_score_word_accurate():
     # Assert
     assert score_word("A") == 1
     assert score_word("DOG") == 5
     assert score_word("WHIMSY") == 17
 
+# @pytest.mark.skip
 def test_score_word_accurate_ignores_case():
     # Assert
     assert score_word("a") == 1
     assert score_word("dog") == 5
     assert score_word("wHiMsY") == 17
 
+# @pytest.mark.skip
 def test_score_zero_for_empty():
     # Assert
     assert score_word("") == 0
 
+# @pytest.mark.skip
 def test_score_extra_points_for_seven_or_longer():
     # Assert
     assert score_word("XXXXXXX") == 64