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

Jyotsna's commit #35

Open
wants to merge 2 commits into
base: gradle
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
118 changes: 116 additions & 2 deletions src/main/java/com/hangman/players/YourPlayer.java
Original file line number Diff line number Diff line change
@@ -1,13 +1,127 @@
package com.hangman.players;
import com.hangman.Player;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.List;

public class YourPlayer implements Player {
List<Character> usedChars = new ArrayList<>();
@Override
public char GetGuess(List<Character> currentClue) {
return 'a';
return returnNextPopularChoice(currentClue);
}

public char returnNextPopularChoice(List<Character> currentClue){
if (!currentClue.contains('e') && !usedChars.contains('e')){
addToUsedChars('e');
return 'e';
}
if (!currentClue.contains('a') && !usedChars.contains('a')){
addToUsedChars('a');
return 'a';
}
if (!currentClue.contains('s') && !usedChars.contains('s')){
addToUsedChars('s');
return 's';
}
if (!currentClue.contains('t') && !usedChars.contains('t')){
addToUsedChars('t');
return 't';
}
if (!currentClue.contains('r') && !usedChars.contains('r')){
addToUsedChars('r');
return 'r';
}
if (!currentClue.contains('l') && !usedChars.contains('l')){
addToUsedChars('l');
return 'l';
}
if(!currentClue.contains('n') && !usedChars.contains('n')){
addToUsedChars('n');
return 'n';
}
if (!currentClue.contains('i') && !usedChars.contains('i')){
addToUsedChars('i');
return 'i';
}
if (!currentClue.contains(('o')) && !usedChars.contains('o')){
addToUsedChars('o');
return 'o';
}
if(!currentClue.contains('c') && !usedChars.contains('c')){
addToUsedChars('c');
return 'c';
}
if(!currentClue.contains('d') && !usedChars.contains('d')){
addToUsedChars('d');
return 'd';
}
if(!currentClue.contains('b') && !usedChars.contains('b')){
addToUsedChars('b');
return 'b';
}
if(!currentClue.contains('f') && !usedChars.contains('f')){
addToUsedChars('f');
return 'f';
}
if(!currentClue.contains('j') && !usedChars.contains('j')){
addToUsedChars('j');
return 'j';
}
if (!currentClue.contains('u') && !usedChars.contains('u')) {
addToUsedChars('u');
return 'u';
}
if (!currentClue.contains('y') && !usedChars.contains('y')) {
addToUsedChars('y');
return 'y';
}
if(!currentClue.contains('p') && !usedChars.contains('p')){
addToUsedChars('p');
return 'p';
}
if(!currentClue.contains('g') && !usedChars.contains('g')){
addToUsedChars('g');
return 'g';
}
if(!currentClue.contains('h') && !usedChars.contains('h')){
addToUsedChars('h');
return 'h';
}
if(!currentClue.contains('z') && !usedChars.contains('z')){
addToUsedChars('z');
return 'z';
}
if(!currentClue.contains('m') && !usedChars.contains('m')){
addToUsedChars('m');
return 'm';
}
if(!currentClue.contains('x') && !usedChars.contains('x')){
addToUsedChars('x');
return 'x';
}
if(!currentClue.contains('k') && !usedChars.contains('k')){
addToUsedChars('k');
return 'k';
}
if(!currentClue.contains('q') && !usedChars.contains('q')){
addToUsedChars('q');
return 'q';
}
if(!currentClue.contains('v') && !usedChars.contains('v')){
addToUsedChars('v');
return 'v';
}
if(!currentClue.contains('w') && !usedChars.contains('w')){
addToUsedChars('w');
return 'w';
}
throw new IllegalStateException("All consonants exhausted.");
}

public void addToUsedChars(char addThisChar){
usedChars.add(addThisChar);
}

}
29 changes: 25 additions & 4 deletions src/test/java/com/hangman/players/YourPlayerTest.java
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,8 @@

import org.junit.Test;
import java.util.Arrays;
import java.util.List;

import static org.junit.Assert.assertEquals;

public class YourPlayerTest {
Expand All @@ -11,24 +13,43 @@ public void GuessesAWhenThereAreNoSuccessfulCharactersGuessedYet() {

char guess = player.GetGuess(Arrays.asList('_', '_', '_'));

assertEquals('a', guess);
assertEquals('e', guess);
}

@Test
public void GuessesAWhenThereAreSuccessfulCharactersGuessedThatAreNotA() {
YourPlayer player = new YourPlayer();

char guess = player.GetGuess(Arrays.asList('m', '_', 'n'));
char guess = player.GetGuess(Arrays.asList('m', 'e', '_', 'n'));

assertEquals('a', guess);
}

@Test
public void GuessesAWhenAIsThereAreAsInTheClueAsWell() {
public void DoNotGuessAIfAlreadyGuessed(){
YourPlayer player = new YourPlayer();

char guess = player.GetGuess(Arrays.asList('_', 'a', '_'));

assertEquals('a', guess);
assertEquals('e', guess);
}

@Test
public void ReturnConsonantInOrderOfPopularity(){
YourPlayer player = new YourPlayer();
List<Character> currentClue = Arrays.asList('a', 'e', 'i', '_', 'o', 'u', 'y');

char guess = player.GetGuess(currentClue);

assertEquals('s', guess);
}

@Test
public void ShouldAddToListOfUsedChars(){
YourPlayer player = new YourPlayer();

player.addToUsedChars('a');

assertEquals(true, player.usedChars.contains('a'));
}
}