diff --git a/src/adagrams.js b/src/adagrams.js
index 7ec5afc7..548f35ce 100644
--- a/src/adagrams.js
+++ b/src/adagrams.js
@@ -1,15 +1,122 @@
 export const drawLetters = () => {
-  // Implement this method for wave 1
+  const letterPool = [
+    ...Array(9).fill('A'),
+    ...Array(2).fill('B'),
+    ...Array(2).fill('C'),
+    ...Array(4).fill('D'),
+    ...Array(12).fill('E'),
+    ...Array(2).fill('F'),
+    ...Array(3).fill('G'),
+    ...Array(2).fill('H'),
+    ...Array(9).fill('I'),
+    'J',
+    'K',
+    ...Array(4).fill('L'),
+    ...Array(2).fill('M'),
+    ...Array(6).fill('N'),
+    ...Array(8).fill('O'),
+    ...Array(2).fill('P'),
+    'Q',
+    ...Array(6).fill('R'),
+    ...Array(4).fill('S'),
+    ...Array(6).fill('T'),
+    ...Array(4).fill('U'),
+    ...Array(2).fill('V'),
+    ...Array(2).fill('W'),
+    'X',
+    ...Array(2).fill('Y'),
+    'Z',
+  ];
+  const hand = [];
+
+  while (hand.length < 10) {
+    const randomIndex = Math.floor(Math.random() * letterPool.length);
+    const letter = letterPool[randomIndex];
+
+    if (hand.filter((l) => l === letter).length < letterPool.filter((l) => l === letter).length) {
+      hand.push(letter);
+    }
+  }
+
+  return hand;
 };
 
+// check for input validity - can given letters form word
 export const usesAvailableLetters = (input, lettersInHand) => {
-  // Implement this method for wave 2
+  const handCopy = [...lettersInHand];
+
+  for (const letter of input) {
+    const index = handCopy.indexOf(letter);
+
+    if (index === -1) {
+      return false;
+    }
+
+    handCopy.splice(index, 1);
+  }
+
+  return true;
 };
 
+// calculate score for a word
 export const scoreWord = (word) => {
-  // Implement this method for wave 3
+  if (word === "") {
+    return 0;
+  }
+
+  const letterScores = {
+    A: 1, E: 1, I: 1, O: 1,
+    U: 1, L: 1, N: 1, R: 1,
+    S: 1, T: 1, D: 2, G: 2,
+    B: 3, C: 3, M: 3, P: 3,
+    F: 4, H: 4, V: 4, W: 4,
+    Y: 4, K: 5, J: 8, X: 8,
+    Q: 10, Z: 10,
+  };
+
+  let score = 0;
+
+  for (const letter of word.toUpperCase()) {
+    score += letterScores[letter];
+  }
+
+  if (word.length >= 7 && word.length <= 10) {
+    score += 8;
+  }
+
+  return score;
 };
 
+
+// find word w/ highest score
 export const highestScoreFrom = (words) => {
-  // Implement this method for wave 4
+  let highestScore = 0;
+  let highestScoringWords = [];
+
+  for (const word of words) {
+    const score = scoreWord(word);
+
+    if (score > highestScore) {
+      highestScore = score;
+      highestScoringWords = [{ word, score }];
+    } else if (score === highestScore) {
+      highestScoringWords.push({ word, score });
+    }
+  }
+
+  if (highestScoringWords.length === 1) {
+    return highestScoringWords[0];
+  } else {
+    let winningWord = highestScoringWords[0];
+
+    for (const wordData of highestScoringWords) {
+      if (wordData.word.length === 10) {
+        return wordData;
+      } else if (wordData.word.length < winningWord.word.length && winningWord.word.length !== 10) {
+        winningWord = wordData;
+      }
+    }
+
+    return winningWord;
+  }
 };
diff --git a/test/adagrams.test.js b/test/adagrams.test.js
index 1a0dc94e..67b31003 100644
--- a/test/adagrams.test.js
+++ b/test/adagrams.test.js
@@ -120,7 +120,12 @@ describe("Adagrams", () => {
     });
 
     it("returns a score of 0 if given an empty input", () => {
-      throw "Complete test";
+      const word = "";
+      const correctScore = 0;
+    
+      const result = scoreWord(word);
+    
+      expect(result).toBe(correctScore);
     });
 
     it("adds an extra 8 points if word is 7 or more characters long", () => {
@@ -133,7 +138,7 @@ describe("Adagrams", () => {
     });
   });
 
-  describe.skip("highestScoreFrom", () => {
+  describe("highestScoreFrom", () => {
     it("returns a hash that contains the word and score of best word in an array", () => {
       const words = ["X", "XX", "XXX", "XXXX"];
       const correct = { word: "XXXX", score: scoreWord("XXXX") };
@@ -145,9 +150,11 @@ describe("Adagrams", () => {
       const words = ["XXX", "XXXX", "X", "XX"];
       const correct = { word: "XXXX", score: scoreWord("XXXX") };
 
-      throw "Complete test by adding an assertion";
-    });
+      const result = highestScoreFrom(words);
 
+      expect(result).toEqual(correct);
+    });
+    
     describe("in case of tied score", () => {
       const expectTie = (words) => {
         const scores = words.map((word) => scoreWord(word));
@@ -197,3 +204,8 @@ describe("Adagrams", () => {
     });
   });
 });
+
+
+
+
+
diff --git a/test/demo/model.test.js b/test/demo/model.test.js
index 49bf9599..52ae8d23 100644
--- a/test/demo/model.test.js
+++ b/test/demo/model.test.js
@@ -1,7 +1,7 @@
 import Model from 'demo/model';
 import Adagrams from 'demo/adagrams';
 
-describe.skip('Game Model', () => {
+describe('Game Model', () => {
   const config = {
     players: [
       'Player A',