-
Notifications
You must be signed in to change notification settings - Fork 0
/
wordle_guesser.py
224 lines (174 loc) · 6.84 KB
/
wordle_guesser.py
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
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
import numpy as np
import math
import random
import json
EXTENDED = False
HARD_MODE = False
guessing_list = []
answer_list = set()
class DecisionTreeNode:
def __init__(self, word, bins):
self.word = word
self.masks = bins
def get_json(self, squares = 0):
root = {"guess" : self.word, "squares" : squares, "children" : []}
for k, v in self.masks.items():
root["children"].append(v.get_json(k))
return root
if EXTENDED:
with open("wordle_occurrence_list.txt", 'r') as fin:
for line in fin:
w, o = line.split(' ')
guessing_list.append(w)
answer_list.add((w, int(o)))
else:
with open("wordle_dictionary.txt", 'r') as fin:
for line in fin:
guessing_list.append(line[:5])
size = len(guessing_list)
answer_list = set([(w, 1) for w in guessing_list])
def get_mask(guess, answer):
# Mask defaults to all wrong and convert strings to lists
guess = list(guess)
answer = list(answer)
mask = [0,0,0,0,0]
# If exact match
for i in range(5):
if guess[i] == answer[i]:
mask[i] = 2
guess[i] = 'X' # Make sure it doesn't get double counted in next step
answer[i] = 'Y'
# Find anything in wrong spot
for i,l in enumerate(guess):
try:
j = answer.index(l)
mask[i] = 1
answer[j] = 'Y'
except ValueError as err:
pass
# Convert to base3 number (big-endian)
mask.reverse()
return sum([(10**i)*v for i,v in enumerate(mask)])
#return "".join([str(x) for x in mask])
def compute_entropy(int_list):
total = sum(int_list)
entropy = 0.0
for i in int_list:
p = i / total
entropy -= math.log(p) * p
return entropy
def make_guess(guessing_list, answer_list):
# Restructure guessing list as dictionary, with words mapping to sub-dictionaries, explained later
max_entropy = -1
best_guess = "idk"
remaining_entropy = compute_entropy([p for a, p in answer_list])
if len(answer_list) == 1:
a, o = answer_list[0]
return a
for guess in guessing_list:
bins = {}
for a, p in answer_list:
mask = get_mask(guess, a)
if not mask in bins.keys():
bins[mask] = [(a, p)]
else:
bins[mask].append((a, p))
# Replace best guess if there's a word with better entropy
# Or: if there's a word with less entropy, but enough to ascertain the answer on the next
# guess, and that's in the answer list, use that instead. Maybe we'll get lucky
new_entropy = compute_entropy([sum([p for a, p in mask_list]) for mask_list in bins.values()])
if new_entropy > max_entropy or (guess in [a for a, p in answer_list]
and best_guess not in [a for a, p in answer_list]
and new_entropy >= remaining_entropy):
max_entropy = new_entropy
best_guess = guess
return best_guess
# Start guess of base list: raise, H = 4.074
# Start guess of exte list: soare, H = 4.079
# def guesses_to_get(answer, guessing_list, answer_list):
# guesses = 0
# while True:
# if guesses == 0:
# if EXTENDED:
# best_guess = 'soare'
# else:
# best_guess = 'raise'
# else:
# best_guess, bins = make_guess(guessing_list, answer_list)
# guesses += 1
# if best_guess == answer:
# return guesses
# mask = get_mask(best_guess, answer)
# answer_list = list(filter(lambda a : get_mask(best_guess, a) == mask, answer_list))
# if HARD_MODE:
# guessing_list = answer_list # Only guess things that might actually be the answer now (hard mode)
# if len(answer_list) == 0:
# print("One of us messed up somewhere cause there's no more possible words")
# return -1
def build_tree(guessing_list, answer_list):
first_guess = make_guess(guessing_list, answer_list)
root = DecisionTreeNode(first_guess, {}) # It'll be raise
# Define tree here
for answer, p in answer_list:
print("Answer is", answer, end=': ')
temp_list = answer_list
guess = root
print(guess.word, end=' ')
# Lookup in tree, going as far down as we can go
m = get_mask(guess.word, answer)
while (m in guess.masks):
temp_list = list(filter(lambda a : get_mask(guess.word, a[0]) == m, temp_list))
guess = guess.masks[m]
print(guess.word, end=' ')
m = get_mask(guess.word, answer)
if m == 22222:
continue
# If we haven't guessed the answer, start making calls to make_guess(guessing_list, temp_list)
# and build out the tree using the resulting best_guess and the previous mask
while m != 22222:
temp_list = list(filter(lambda a : get_mask(guess.word, a[0]) == m, temp_list))
best_guess = make_guess(guessing_list, temp_list)
guess.masks[m] = DecisionTreeNode(best_guess, {})
guess = guess.masks[m]
print(guess.word, end=' ')
m = get_mask(guess.word, answer) # guess.word == best_guess
print(flush=True)
return root.get_json()
dt = build_tree(guessing_list, answer_list)
json_dump = json.dumps(dt)
with open("answers_ext_decision_tree.json", 'w') as fout:
fout.write(json_dump)
exit()
if EXTENDED:
first_guess = 'tares'
else:
first_guess = 'raise'
# first_guess = random.choice(['stare', 'arise', 'trace', 'irate', 'crate', 'slate', 'raise'])
# first_guess = 'slept'
print('Try', first_guess)
mask = input("What was the result? (in 0,1,2s): ")
mask = sum([(3**i)*int(v) for i,v in enumerate(mask)])
answer_list = list(filter(lambda a : get_mask(first_guess, a[0]) == mask, answer_list))
print("Possible words:", len(answer_list))
if len(answer_list) < 20:
print(answer_list)
if HARD_MODE:
guessing_list = [a[0] for a in answer_list]
stop = False
while not stop:
best_guess = make_guess(guessing_list, answer_list)
print('Try', best_guess)
mask = input("What was the result? (in 0,1,2s): ")
mask = sum([(3**i)*int(v) for i,v in enumerate(mask)])
answer_list = list(filter(lambda a : get_mask(best_guess, a[0]) == mask, answer_list))
print("Possible words:", len(answer_list))
if len(answer_list) < 20:
print(answer_list)
if HARD_MODE:
guessing_list = [a[0] for a in answer_list] # Only guess things that might actually be the answer now (hard mode)
if len(answer_list) == 0:
print("One of us messed up somewhere cause there's no more possible words")
stop = True
elif len(answer_list) == 1:
print("Answer is", answer_list[0])
stop = True