-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathtrackables.py
354 lines (262 loc) · 12.3 KB
/
trackables.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
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
import ladxrInterface
from datetime import datetime
from ladxrInterface import *
from trackerLogic import applyTrackerLogic
class FakeLogic:
pass
class Accessibility:
def __init__(self, checks, entrances, logicHints, graph):
self.checks = checks
self.entrances = entrances
self.logicHints = logicHints
self.graph = graph
maxLogicCache = 1000
logicCache = {}
def getCachedLogics(hash, args, entranceMap, bossList, minibossMap):
if hash in logicCache:
logics = logicCache[hash]
logics['age'] = datetime.now()
return logics
logics = {}
logics['stock'] = getLogics(args, entranceMap, bossList, minibossMap)
logics['tracker'] = getLogics(args, entranceMap, bossList, minibossMap)
logics['age'] = datetime.now()
for logic in logics['tracker']:
applyTrackerLogic(logic)
logicCache[hash] = logics
trimLogicCache()
return logics
def trimLogicCache():
if len(logicCache) > maxLogicCache:
sortedCache = sorted(logicCache.keys(), key=lambda x: logicCache[x]['age'])
i = 0
while len(logicCache) > maxLogicCache:
del logicCache[sortedCache[i]]
i += 1
def getAccessibility(allChecks, allEntrances, logics, inventory):
ladxrInterface.explorerCache = {}
keyInventory = inventory.copy()
keyInventory['KEY0'] = 9
keyInventory['KEY1'] = 9
keyInventory['KEY2'] = 9
keyInventory['KEY3'] = 9
keyInventory['KEY4'] = 9
keyInventory['KEY5'] = 9
keyInventory['KEY6'] = 9
keyInventory['KEY7'] = 9
keyInventory['KEY8'] = 9
checkAccessibility = getCheckAccessibility(allChecks, logics['stock'], inventory, keyInventory)
entranceAccessibility = {}
if allEntrances:
entranceAccessibility = getEntranceAccessibility(allEntrances, logics['stock'], inventory.copy())
graphAccessibility = getGraphAccessibility(logics['tracker'], inventory)
getCheckTrackerAccessibility(logics['tracker'], inventory, keyInventory, checkAccessibility)
if allEntrances:
getEntranceTrackerAccessibility(logics['tracker'], inventory.copy(), entranceAccessibility)
logicHintAccessibility = {}
for log in logics['tracker']:
logicHintAccessibility[log.name] = {x for x in checkAccessibility[log.name] if x.logicHint}
for check in logicHintAccessibility[log.name]:
checkAccessibility[log.name].remove(check)
return Accessibility(checkAccessibility, entranceAccessibility, logicHintAccessibility, graphAccessibility)
def getCheckTrackerAccessibility(logics, inventory, keyInventory, accessibility):
alreadyFound = set()
behindKeys = set()
for i in range(len(logics)):
logics[i].difficulty = i
level = accessibility[logics[i].name]
behindKeys = behindKeys.union({x.id for x in level if x.behindKeys})
checksBehindTrackerLogic = set(loadChecks(logics[i], inventory)).difference(level)
checksBehindBoth = set(loadChecks(logics[i], keyInventory)).difference(level, checksBehindTrackerLogic)
checksBehindTrackerLogic = checksBehindTrackerLogic.difference({x for x in checksBehindTrackerLogic if x.id in behindKeys})
checksBehindBoth = checksBehindBoth.difference({x for x in checksBehindBoth if x.id in behindKeys})
for j in range(i):
checksBehindTrackerLogic = checksBehindTrackerLogic.difference(accessibility[logics[j].name])
checksBehindBoth = checksBehindBoth.difference(accessibility[logics[j].name])
for check in checksBehindTrackerLogic:
if check in alreadyFound:
continue
alreadyFound.add(check)
level.add(check.cloneBehindTrackerLogic())
for check in checksBehindBoth:
if check in alreadyFound:
continue
alreadyFound.add(check)
level.add(check.cloneBehindBoth())
for check in level:
check.difficulty = i
for log in logics:
if log.difficulty == 9:
accessibility[log.name] = accessibility[log.name].difference(alreadyFound)
def getEntranceTrackerAccessibility(logics, inventory, accessibility):
found = {x for x in accessibility if accessibility[x].difficulty != 9}
# Initialize each logic level with their full list of accessible entrance IDs
for i in range(len(logics)):
logic = logics[i]
behindTrackerLogic = set(loadEntrances(logic, inventory)).difference(found)
found = behindTrackerLogic.union(found)
for entrance in behindTrackerLogic:
if entrance not in accessibility:
accessibility[entrance] = Entrance(entrance, i, behindTrackerLogic=True)
continue
accessibility[entrance].difficulty = i
accessibility[entrance].behindTrackerLogic = True
def getGraphAccessibility(logics, inventory):
accessibility = {}
for i in range(len(logics)):
logic = logics[i]
e = visitLogic(logic, inventory)
accessibleLocations = e.getAccessableLocations()
for loc in logic.location_list:
name = loc.friendlyName()
if name == '':
continue
if name not in accessibility:
accessibility[name] = {}
accessibility[name]['connections'] = {}
accessibility[name]['checks'] = [x.nameId for x in loc.items]
accessibility[name]['id'] = name
accLoc = accessibility[name]
if 'diff' not in accLoc and loc in accessibleLocations:
accLoc['diff'] = i
for connection in loc.simple_connections + loc.gated_connections:
toName = connection[0].friendlyName()
requirement = connection[1]
id = None if len(connection) < 3 else connection[2]
fullReqName = str(requirement)
shortReqName = fullReqName
connId = name + '->' + toName + ':' + fullReqName
if hasattr(requirement, 'shortName'):
shortReqName = requirement.shortName(logic)
if connId not in accLoc['connections']:
to = connection[0]
matchingConnections = [x for x in to.simple_connections + to.gated_connections if str(x[1]) == fullReqName]
newConnection = {
'from': name,
'to': toName,
'req': fullReqName,
'diff': i,
'id': id,
}
accLoc['connections'][connId] = newConnection
if fullReqName != shortReqName:
newConnection['shortReq'] = shortReqName
if not matchingConnections:
newConnection['oneWay'] = True
if testRequirement(requirement, inventory):
newConnection['met'] = True
entrancesByLocation = {}
for entrance,loc in logics[0].world.entrances.items():
name = loc.location.friendlyName()
if name not in entrancesByLocation:
entrancesByLocation[name] = []
entrancesByLocation[name].append(entrance)
for name,loc in accessibility.items():
if name in entrancesByLocation:
accessibility[name]['entrances'] = entrancesByLocation[name]
for id,connection in loc['connections'].items():
if 'oneWay' in connection and connection['to'] in accessibility:
newConnection = connection.copy()
newConnection['badWay'] = True
del newConnection['oneWay']
to = accessibility[connection['to']]
to['connections'][id] = newConnection
for name in accessibility:
accessibility[name]['connections'] = [v for (k,v) in accessibility[name]['connections'].items()]
return accessibility
def testRequirement(requirement, inventory):
if not requirement:
return True
if type(requirement) == str:
return requirement in inventory
return requirement.test(inventory)
def getCheckAccessibility(allChecks, logics, inventory, keyInventory):
accessibility = {}
outOfLogic = set(allChecks)
# Initialize each logic level with their full list of accessible Check objects
for i in range(len(logics)):
logic = logics[i]
accessibility[logic.name] = set(loadChecks(logic, inventory))
outOfLogic = outOfLogic.difference(accessibility[logic.name])
# Remove duplicate checks from higher logic levels
for i in range(1, len(logics)):
for j in range(i):
accessibility[logics[i].name] = accessibility[logics[i].name].difference(accessibility[logics[j].name])
# Find more checks that are behind small keys
alreadyInKeyLogic = set()
for i in range(len(logics)):
level = accessibility[logics[i].name]
checksBehindKeys = set(loadChecks(logics[i], keyInventory)).difference(level)
for j in range(i):
checksBehindKeys = checksBehindKeys.difference(accessibility[logics[j].name])
for check in checksBehindKeys:
if check in alreadyInKeyLogic:
continue
alreadyInKeyLogic.add(check)
level.add(check.cloneBehindKeys())
# Assign difficulties to each logic level (not just key locked)
logics[i].difficulty = i
outOfLogic = outOfLogic.difference(alreadyInKeyLogic)
logics[0].friendlyName = 'In logic'
for check in outOfLogic:
check.difficulty = 9
for i in range(1, len(logics)):
logics[i].friendlyName = f'In {logics[i].name} logic'
oolLogic = FakeLogic()
oolLogic.name = 'ool'
oolLogic.friendlyName = 'Out of logic'
oolLogic.difficulty = 9
accessibility[oolLogic.name] = outOfLogic
return accessibility
def getEntranceAccessibility(allEntrances, logics, inventory):
accessibility = {}
entrances = {}
outOfLogic = set(allEntrances)
# Initialize each logic level with their full list of accessible entrance IDs
for i in range(len(logics)):
logic = logics[i]
accessibility[logic] = set(loadEntrances(logic, inventory))
outOfLogic = outOfLogic.difference(accessibility[logics[i]])
# Remove duplicate entrances from higher logic levels
for i in range(1, len(logics)):
for j in range(i):
accessibility[logics[i]] = accessibility[logics[i]].difference(accessibility[logics[j]])
# Convert the entrance IDs to Entrance objects
for i in range(len(logics)):
for name in accessibility[logics[i]]:
entrance = Entrance(name, i)
entrances[name] = entrance
for name in outOfLogic:
entrances[name] = Entrance(name, 9)
return entrances
def addStartingItems(inventory, args, settings):
inventory['RUPEES_500'] = 10
inventory['TRUE'] = 1
if args.dungeon_items == 'keysy':
for i in range(9):
for amount, item_name in ((9, "KEY"), (1, "NIGHTMARE_KEY")):
item_name = f"{item_name}{i + 1}"
inventory[item_name] = amount
if (args.owlstatues not in ['both', 'dungeon']
and 'bingo' not in args.goal
and ('enableAutotracking' not in settings
or not settings['enableAutotracking'])):
for i in range(9):
inventory[f"STONE_BEAK{i + 1}"] = 1
def cleanUpEntranceMap(entranceMap, entrances, args):
for source, dest in [x for x in entranceMap.items()]:
if dest in {'landfill', 'bk_shop', 'bk_shop:inside'}:
entranceMap[source] = 'start_house:inside'
if source in {"null", None} or dest in {"null", None}:
del entranceMap[source]
for entrance in list(entranceMap.keys()):
if entrance not in entrances:
del entranceMap[entrance]
if entranceMap == {} and args.randomstartlocation:
entranceMap['start_house'] = 'rooster_house'
if not args.randomstartlocation:
reverseMap = {value: key for (key, value) in entranceMap.items()}
if 'start_house' in entranceMap:
del entranceMap['start_house']
if 'start_house' in reverseMap:
del entranceMap[reverseMap['start_house']]