C22 Phoenix - Jen Nguyen

src/adagrams.js

@@ -1,15 +1,68 @@
+import {
+  maxLetters,
+  minWordLengthForBonus,
+  bonusPoints,
+  letterPool,
+  scoreChart
+} from './constants';
+
 export const drawLetters = () => {
-  // Implement this method for wave 1
+  const lettersAvailable = [];
+  for (const letter in letterPool) {
+    for (let i = 0; i < letterPool[letter]; i++) {
+      lettersAvailable.push(letter);
+    }
+  }
+
+  const lettersDrawn = [];
+  for (let i = 0; i < maxLetters; i++) {
+    const randomNumber = Math.floor(Math.random() * lettersAvailable.length);
+    lettersDrawn.push(lettersAvailable[randomNumber]);
+    lettersAvailable.splice(randomNumber, 1);
+  }
+  return lettersDrawn;
 };
 
-export const usesAvailableLetters = (input, lettersInHand) => {
-  // Implement this method for wave 2
+export const usesAvailableLetters = (input, lettersInHand) => {  
+  const letterBank = {};
+  for (const letter of lettersInHand) {
+    letterBank[letter] = (letterBank[letter] || 0) + 1;
+  }
+
+  for (const letter of input.toUpperCase()) {
+    if (!letterBank[letter]) return false;
+    letterBank[letter]--;
+    }
+  return true;
 };
 
 export const scoreWord = (word) => {
-  // Implement this method for wave 3
+  let score = 0;
+  for (const letter of word.toUpperCase()) {
+    score += scoreChart[letter];
+  }
+
+  if (word.length >= minWordLengthForBonus && word.length <= maxLetters) {
+    score += bonusPoints;
+  }
+  return score;
 };
 
 export const highestScoreFrom = (words) => {
-  // Implement this method for wave 4
-};
+  const winner = {
+    word: '',
+    score: 0
+  };
+  for (const word of words) {
+    let score = scoreWord(word);
+    if (score > winner.score) {
+      winner.score = score;
+      winner.word = word;
+    } else if (score === winner.score) {
+      if (winner.word.length !== maxLetters && (word.length < winner.word.length || word.length === maxLetters)) {
+        winner.word = word;
+      }
+    }
+  }
+  return winner;
+};

src/constants.js

@@ -0,0 +1,61 @@
+export const maxLetters = 10;
+export const minWordLengthForBonus = 7;
+export const bonusPoints = 8;
+
+export const letterPool = {
+  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
+};
+
+export const scoreChart = {
+  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
+};

test/adagrams.test.js

@@ -120,7 +120,9 @@ describe("Adagrams", () => {
     });
 
     it("returns a score of 0 if given an empty input", () => {
-      throw "Complete test";
+      expectScores({
+        '' : 0
+      });
     });
 
     it("adds an extra 8 points if word is 7 or more characters long", () => {
@@ -133,7 +135,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,7 +147,7 @@ describe("Adagrams", () => {
       const words = ["XXX", "XXXX", "X", "XX"];
       const correct = { word: "XXXX", score: scoreWord("XXXX") };
 
-      throw "Complete test by adding an assertion";
+      expect(highestScoreFrom(words)).toEqual(correct);
     });
 
     describe("in case of tied score", () => {

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',