-
Notifications
You must be signed in to change notification settings - Fork 0
/
analysis.cpp
49 lines (37 loc) · 1.14 KB
/
analysis.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
#include "wordle_tools.hpp"
#include "timer.hpp"
#include <algorithm>
#include <unordered_map>
struct array_hasher {
template<size_t n>
std::size_t operator()(const std::array< Clue, n > & arr) const {
uint64_t seed = 0;
for(const auto elem : arr) {
seed ^= std::hash<uint64_t>()(elem) + 0x9e3779b9 + (seed<<6) + (seed>>2);
}
return seed;
}
};
using clue_count = std::unordered_map< std::array<Clue, 5>, int, array_hasher >;
clue_count get_counts(const std::vector< Word > & words, Word guess) {
clue_count counts;
for (auto w : words) counts[get_clues(guess, w)]++;
return counts;
}
int main() {
std::vector< std::tuple< float, std::string > > results;
results.reserve(all_words.size());
for (auto guess : all_words) {
clue_count counts = get_counts(all_answers, guess);
float entropy = 0.0;
for (auto & [k, v] : counts) {
float p = float(v) / all_answers.size();
entropy -= p * log2f(p);
}
results.push_back({entropy, guess.data});
}
std::sort(results.begin(), results.end());
for (auto & [entropy, word] : results) {
std::cout << word << ": " << entropy << std::endl;
}
}