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
135
136
137
|
#include <iostream>
#include <string>
#include <fstream>
#include <list>
#include <map>
#include <unordered_map>
#include <set>
#include <vector>
using namespace std;
const string ALPHABET = "abcdefghijklmnopqrstuvwxyz";
void openDictionary(map<int, list<string>> &wordsByLength, string path) {
ifstream input;
input.open(path);
string word;
while (input >> word) {
int length = word.length();
if (wordsByLength.count(length) == 0) {
wordsByLength[length] = list<string>();
}
wordsByLength[length].push_front(word);
}
input.close();
}
// update prototype
void getWordPrototype(string &wordCandidate, string &word, char guess) {
for (int i = 0; i < word.size(); i++) {
if (word[i] == guess) {
wordCandidate[i] = guess;
}
}
}
// populate wordGroup with the biggest word group after selecting words for guess from word, return wether prototype changed
bool getWordGroup(list<string> &wordGroup, string &wordPrototype, char guess) {
unordered_map<string, list<string>> wordGroups;
for (string &word: wordGroup) {
if (word.find(guess) == string::npos) {
// word doesn't contain guess
if (wordGroups.count(wordPrototype) == 0) {
wordGroups[wordPrototype] = list<string>();
}
wordGroups[wordPrototype].push_back(word);
} else {
// word contains guess at least once
string newWordPrototype(wordPrototype);
getWordPrototype(newWordPrototype, word, guess);
if (wordGroups.count(newWordPrototype) == 0) {
wordGroups[newWordPrototype] = list<string>();
}
wordGroups[newWordPrototype].push_back(word);
}
}
// find biggest word group
int maxSize = 0;
string maxWord;
for (auto &n: wordGroups) {
int size = n.second.size();
if (size > maxSize) {
maxSize = size;
maxWord = n.first;
}
}
wordGroup = wordGroups[maxWord];
if (wordPrototype == maxWord) {
return false;
} else {
wordPrototype = maxWord;
return true;
}
}
int main() {
cout << "Welcome to Hangman." << endl;
map<int, list<string>> wordsByLength;
openDictionary(wordsByLength, "res/dictionary.txt");
int wordLength;
while (cout << "Choose a word length to guess: " && cin >> wordLength) {
if (wordsByLength.count(wordLength) == 0) {
cout << "No words of that length found." << endl;
} else {
break;
}
}
int guesses;
cout << "Choose number of guesses: ";
cin >> guesses;
bool showWordsLeft;
{
char response;
cout << "Would you like to see the number of words left? [Y/n]: ";
cin >> response;
showWordsLeft = (response != 'n');
}
string wordPrototype;
for (int i = 0; i < wordLength; i++) {
wordPrototype.push_back('-');
}
list<string> wordGroup = wordsByLength[wordLength];
set<char> guessedChars;
bool won = false;
while (guesses > 0 && !won) {
if (showWordsLeft) {
cout << "(" << wordGroup.size() << ") ";
}
cout << wordPrototype << " with " << guesses << " guesses left. Guessed characters: ";
for (char c: guessedChars) {
cout << c;
}
cout << endl;
cout << "Guess a letter: ";
char guess;
cin >> guess;
if (getWordGroup(wordGroup, wordPrototype, guess)) {
won = (wordPrototype.find('-') == string::npos);
} else {
guessedChars.insert(guess);
guesses--;
}
}
if (won) {
cout << "Well done!" << endl;
} else {
cout << "The word was '" << wordGroup.front() << "'. Better luck next time." << endl;
}
}
|
