Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

JS Adagrams - Jasmine S. #150

Open
wants to merge 7 commits into
base: main
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
28 changes: 28 additions & 0 deletions letters.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,28 @@
{
"A": {"frequency": 9,"value": 1},
"B": {"frequency": 2,"value": 3},
"C": {"frequency": 2,"value": 3},
"D": {"frequency": 4,"value": 2},
"E": {"frequency": 12,"value": 1},
"F": {"frequency": 2,"value": 4},
"G": {"frequency": 3,"value": 2},
"H": {"frequency": 2,"value": 4},
"I": {"frequency": 9,"value": 1},
"J": {"frequency": 1,"value": 8},
"K": {"frequency": 1,"value": 5},
"L": {"frequency": 4,"value": 1},
"M": {"frequency": 2,"value": 3},
"N": {"frequency": 6,"value": 1},
"O": {"frequency": 8,"value": 1},
"P": {"frequency": 2,"value": 3},
"Q": {"frequency": 1,"value": 10},
"R": {"frequency": 6,"value": 1},
"S": {"frequency": 4,"value": 1},
"T": {"frequency": 6,"value": 1},
"U": {"frequency": 4,"value": 1},
"V": {"frequency": 2,"value": 4},
"W": {"frequency": 2,"value": 4},
"X": {"frequency": 1,"value": 8},
"Y": {"frequency": 2,"value": 4},
"Z": {"frequency": 1,"value": 10}
}
71 changes: 66 additions & 5 deletions src/adagrams.js
Original file line number Diff line number Diff line change
@@ -1,15 +1,76 @@
import LetterTiles from '../letters.json';

export const drawLetters = () => {
// Implement this method for wave 1
let letterBank = [];
for (let letter of Object.keys(LetterTiles)) {
for (let step = 0; step < LetterTiles[letter].frequency; step++) {
letterBank.push(letter)
}
}

let playerHand = [];
while (playerHand.length < 10) {
let index = (Math.floor(Math.random() * letterBank.length));
let currentLetter = letterBank[index];
playerHand.push(currentLetter);
letterBank.splice(index, 1);
}
return playerHand;

};

export const usesAvailableLetters = (input, lettersInHand) => {
// Implement this method for wave 2
const word = input.toUpperCase();
let availableLetters = [...lettersInHand];

for (let letter of word) {
if (!availableLetters.includes(letter)) {
return false;
}
availableLetters.splice(availableLetters.lastIndexOf(letter), 1);
}

return true;
};

export const scoreWord = (word) => {
// Implement this method for wave 3
let score = 0;
word = word.toUpperCase();

for (let letter of word) {
score += LetterTiles[letter].value
}

if (7 <= word.length && word.length <= 10) {
score += 8
}

return score;
};

export const highestScoreFrom = (words) => {
// Implement this method for wave 4
};
let allScores = {};
words.forEach((word) => {allScores[word] = scoreWord(word)});

let bestWord = null;
let bestScore = 0;

for (let word of words) {
let currentScore = allScores[word]

if (currentScore > bestScore) {
bestWord = word;
bestScore = currentScore;
}

if (currentScore === bestScore) {
if (word.length === 10 && bestWord.length != 10) {
bestWord = word;
} else if (word.length < bestWord.length && bestWord.length != 10) {
bestWord = word;
}
}
}

return {"word": bestWord, "score": bestScore};
};
8 changes: 5 additions & 3 deletions test/adagrams.test.js
Original file line number Diff line number Diff line change
Expand Up @@ -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", () => {
Expand All @@ -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") };
Expand All @@ -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", () => {
Expand Down
2 changes: 1 addition & 1 deletion test/demo/model.test.js
Original file line number Diff line number Diff line change
@@ -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',
Expand Down