-
Notifications
You must be signed in to change notification settings - Fork 0
/
FBullCowGame.cpp
134 lines (116 loc) · 2.76 KB
/
FBullCowGame.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
#pragma once
#include "FBullCowGame.h"
#include <map>
// to make syntax more unreal friendly
#define TMap std::map
using int32 = int;
FBullCowGame::FBullCowGame()
{
Reset();
}
int32 FBullCowGame::GetCurrentTry() const { return MyCurrentTry; }
int32 FBullCowGame::GetHiddenWordLength() const { return MyHiddenWord.length(); }
bool FBullCowGame::IsGameWon() const { return bGameIsWon; }
int32 FBullCowGame::GetMaxTries() const
{
TMap <int32, int32> WordLengthToMaxTries{ {3,5}, {4,6}, {5,9}, {6,13}, {7,20} };
return WordLengthToMaxTries[MyHiddenWord.length()];
}
void FBullCowGame::Reset()
{
const FString HIDDEN_WORD = "planet"; // this MUST be an isogram
bGameIsWon = false;
MyCurrentTry = 1;
MyHiddenWord = HIDDEN_WORD;
return;
}
FBullCowCount FBullCowGame::SubmitValidGuess(FString Guess)
{
// receives VALID guess, increments turn and returns count
MyCurrentTry++;
FBullCowCount BullCowCount; // will have Bulls and Cows initialized to zero
// loop through all letters in hidden word
int32 HiddenWordLength = MyHiddenWord.length();
for (int32 MHWChar = 0; MHWChar < HiddenWordLength; MHWChar++)
{
// compare letters against guess
for (int32 GChar = 0; GChar < HiddenWordLength; GChar++)
{
// if they match then
if (Guess[MHWChar] == MyHiddenWord[GChar])
{
if (MHWChar == GChar)
{
BullCowCount.Bulls += 1; // increment bulls
}
else
{
BullCowCount.Cows += 1; // increment cows
}
}
}
}
if (BullCowCount.Bulls == HiddenWordLength)
{
bGameIsWon = true;
}
else
{
bGameIsWon = false;
}
return BullCowCount;
}
bool FBullCowGame::IsIsogram(FString Guess) const
{
// Treat 0 and 1 letter words as isogram
if (Guess.length() <= 1)
{
return true;
}
TMap<char, bool> LetterSeen;
for (auto Letter : Guess) // for all letters of the word
{
Letter = tolower(Letter); // Changes letter to lowercase
// add each letter to the map
if (LetterSeen[Letter] == false)
{
LetterSeen[Letter] = true; // if its false, change to true
}
else if (LetterSeen[Letter] == true)
{
return false; // if its true return false
}
//else return true
}
return true;
}
bool FBullCowGame::IsLowercase(FString Guess) const
{
for (auto Letter : Guess)
{
if (!islower(Letter)) // not lowercase
{
return false;
}
}
return true;
}
EGuessStatus FBullCowGame::CheckGuessValidity(FString Guess) const
{
if (!IsIsogram(Guess)) // If guess isn't an isogram
{
return EGuessStatus::Not_Isogram;
}
else if (!IsLowercase(Guess))// if the guess isn't all lowercase
{
return EGuessStatus::Not_Lowercase;
}
else if (Guess.length() != GetHiddenWordLength()) // if the guess isn't the right length
{
return EGuessStatus::Wrong_Length;
}
else
{
return EGuessStatus::OK; //otherwise, return OK
}
}