diff options
Diffstat (limited to 'apworld/player_logic.py')
-rw-r--r-- | apworld/player_logic.py | 391 |
1 files changed, 341 insertions, 50 deletions
diff --git a/apworld/player_logic.py b/apworld/player_logic.py index 6feef99..84c93c8 100644 --- a/apworld/player_logic.py +++ b/apworld/player_logic.py | |||
@@ -1,6 +1,11 @@ | |||
1 | from enum import IntEnum, auto | ||
2 | |||
1 | from .generated import data_pb2 as data_pb2 | 3 | from .generated import data_pb2 as data_pb2 |
4 | from .items import SYMBOL_ITEMS | ||
2 | from typing import TYPE_CHECKING, NamedTuple | 5 | from typing import TYPE_CHECKING, NamedTuple |
3 | 6 | ||
7 | from .options import ShuffleLetters, CyanDoorBehavior | ||
8 | |||
4 | if TYPE_CHECKING: | 9 | if TYPE_CHECKING: |
5 | from . import Lingo2World | 10 | from . import Lingo2World |
6 | 11 | ||
@@ -12,64 +17,175 @@ def calculate_letter_histogram(solution: str) -> dict[str, int]: | |||
12 | real_l = l.upper() | 17 | real_l = l.upper() |
13 | histogram[real_l] = min(histogram.get(real_l, 0) + 1, 2) | 18 | histogram[real_l] = min(histogram.get(real_l, 0) + 1, 2) |
14 | 19 | ||
15 | for free_letter in "HINT": | ||
16 | if histogram.get(free_letter, 0) == 1: | ||
17 | del histogram[free_letter] | ||
18 | |||
19 | return histogram | 20 | return histogram |
20 | 21 | ||
21 | 22 | ||
22 | class AccessRequirements: | 23 | class AccessRequirements: |
23 | items: set[str] | 24 | items: set[str] |
25 | progressives: dict[str, int] | ||
24 | rooms: set[str] | 26 | rooms: set[str] |
25 | symbols: set[str] | ||
26 | letters: dict[str, int] | 27 | letters: dict[str, int] |
28 | cyans: bool | ||
27 | 29 | ||
28 | # This is an AND of ORs. | 30 | # This is an AND of ORs. |
29 | or_logic: list[list["AccessRequirements"]] | 31 | or_logic: list[list["AccessRequirements"]] |
30 | 32 | ||
33 | # When complete_at is set, at least that many of the requirements in possibilities must be accessible. This should | ||
34 | # only be used for doors with complete_at > 1, as or_logic is more efficient for complete_at == 1. | ||
35 | complete_at: int | None | ||
36 | possibilities: list["AccessRequirements"] | ||
37 | |||
31 | def __init__(self): | 38 | def __init__(self): |
32 | self.items = set() | 39 | self.items = set() |
40 | self.progressives = dict() | ||
33 | self.rooms = set() | 41 | self.rooms = set() |
34 | self.symbols = set() | ||
35 | self.letters = dict() | 42 | self.letters = dict() |
43 | self.cyans = False | ||
36 | self.or_logic = list() | 44 | self.or_logic = list() |
45 | self.complete_at = None | ||
46 | self.possibilities = list() | ||
37 | 47 | ||
38 | def add_solution(self, solution: str): | 48 | def copy(self) -> "AccessRequirements": |
39 | histogram = calculate_letter_histogram(solution) | 49 | reqs = AccessRequirements() |
40 | 50 | reqs.items = self.items.copy() | |
41 | for l, a in histogram.items(): | 51 | reqs.progressives = self.progressives.copy() |
42 | self.letters[l] = max(self.letters.get(l, 0), histogram.get(l)) | 52 | reqs.rooms = self.rooms.copy() |
53 | reqs.letters = self.letters.copy() | ||
54 | reqs.cyans = self.cyans | ||
55 | reqs.or_logic = [[other_req.copy() for other_req in disjunction] for disjunction in self.or_logic] | ||
56 | reqs.complete_at = self.complete_at | ||
57 | reqs.possibilities = self.possibilities.copy() | ||
58 | return reqs | ||
43 | 59 | ||
44 | def merge(self, other: "AccessRequirements"): | 60 | def merge(self, other: "AccessRequirements"): |
45 | for item in other.items: | 61 | for item in other.items: |
46 | self.items.add(item) | 62 | self.items.add(item) |
47 | 63 | ||
64 | for item, amount in other.progressives.items(): | ||
65 | self.progressives[item] = max(amount, self.progressives.get(item, 0)) | ||
66 | |||
48 | for room in other.rooms: | 67 | for room in other.rooms: |
49 | self.rooms.add(room) | 68 | self.rooms.add(room) |
50 | 69 | ||
51 | for symbol in other.symbols: | ||
52 | self.symbols.add(symbol) | ||
53 | |||
54 | for letter, level in other.letters.items(): | 70 | for letter, level in other.letters.items(): |
55 | self.letters[letter] = max(self.letters.get(letter, 0), level) | 71 | self.letters[letter] = max(self.letters.get(letter, 0), level) |
56 | 72 | ||
73 | self.cyans = self.cyans or other.cyans | ||
74 | |||
57 | for disjunction in other.or_logic: | 75 | for disjunction in other.or_logic: |
58 | self.or_logic.append(disjunction) | 76 | self.or_logic.append(disjunction) |
59 | 77 | ||
78 | if other.complete_at is not None: | ||
79 | # Merging multiple requirements that use complete_at sucks, and is part of why we want to minimize use of | ||
80 | # it. If both requirements use complete_at, we will cheat by using the or_logic field, which supports | ||
81 | # conjunctions of requirements. | ||
82 | if self.complete_at is not None: | ||
83 | print("Merging requirements with complete_at > 1. This is messy and should be avoided!") | ||
84 | |||
85 | left_req = AccessRequirements() | ||
86 | left_req.complete_at = self.complete_at | ||
87 | left_req.possibilities = self.possibilities | ||
88 | self.or_logic.append([left_req]) | ||
89 | |||
90 | self.complete_at = None | ||
91 | self.possibilities = list() | ||
92 | |||
93 | right_req = AccessRequirements() | ||
94 | right_req.complete_at = other.complete_at | ||
95 | right_req.possibilities = other.possibilities | ||
96 | self.or_logic.append([right_req]) | ||
97 | else: | ||
98 | self.complete_at = other.complete_at | ||
99 | self.possibilities = other.possibilities | ||
100 | |||
101 | def is_empty(self) -> bool: | ||
102 | return (len(self.items) == 0 and len(self.progressives) == 0 and len(self.rooms) == 0 and len(self.letters) == 0 | ||
103 | and not self.cyans and len(self.or_logic) == 0 and self.complete_at is None) | ||
104 | |||
105 | def __eq__(self, other: "AccessRequirements"): | ||
106 | return (self.items == other.items and self.progressives == other.progressives and self.rooms == other.rooms and | ||
107 | self.letters == other.letters and self.cyans == other.cyans and self.or_logic == other.or_logic and | ||
108 | self.complete_at == other.complete_at and self.possibilities == other.possibilities) | ||
109 | |||
110 | def simplify(self): | ||
111 | resimplify = False | ||
112 | |||
113 | if len(self.or_logic) > 0: | ||
114 | old_or_logic = self.or_logic | ||
115 | |||
116 | def remove_redundant(sub_reqs: "AccessRequirements"): | ||
117 | new_reqs = sub_reqs.copy() | ||
118 | new_reqs.letters = {l: v for l, v in new_reqs.letters.items() if self.letters.get(l, 0) < v} | ||
119 | if new_reqs != sub_reqs: | ||
120 | return new_reqs | ||
121 | else: | ||
122 | return sub_reqs | ||
123 | |||
124 | self.or_logic = [] | ||
125 | for disjunction in old_or_logic: | ||
126 | new_disjunction = [] | ||
127 | for ssr in disjunction: | ||
128 | new_ssr = remove_redundant(ssr) | ||
129 | if not new_ssr.is_empty(): | ||
130 | new_disjunction.append(new_ssr) | ||
131 | else: | ||
132 | new_disjunction.clear() | ||
133 | break | ||
134 | if len(new_disjunction) == 1: | ||
135 | self.merge(new_disjunction[0]) | ||
136 | resimplify = True | ||
137 | elif len(new_disjunction) > 1: | ||
138 | if all(cjr == new_disjunction[0] for cjr in new_disjunction): | ||
139 | self.merge(new_disjunction[0]) | ||
140 | resimplify = True | ||
141 | else: | ||
142 | self.or_logic.append(new_disjunction) | ||
143 | |||
144 | if resimplify: | ||
145 | self.simplify() | ||
146 | |||
147 | def get_referenced_rooms(self): | ||
148 | result = set(self.rooms) | ||
149 | |||
150 | for disjunction in self.or_logic: | ||
151 | for sub_req in disjunction: | ||
152 | result = result.union(sub_req.get_referenced_rooms()) | ||
153 | |||
154 | for sub_req in self.possibilities: | ||
155 | result = result.union(sub_req.get_referenced_rooms()) | ||
156 | |||
157 | return result | ||
158 | |||
159 | def remove_room(self, room: str): | ||
160 | if room in self.rooms: | ||
161 | self.rooms.remove(room) | ||
162 | |||
163 | for disjunction in self.or_logic: | ||
164 | for sub_req in disjunction: | ||
165 | sub_req.remove_room(room) | ||
166 | |||
167 | for sub_req in self.possibilities: | ||
168 | sub_req.remove_room(room) | ||
169 | |||
60 | def __repr__(self): | 170 | def __repr__(self): |
61 | parts = [] | 171 | parts = [] |
62 | if len(self.items) > 0: | 172 | if len(self.items) > 0: |
63 | parts.append(f"items={self.items}") | 173 | parts.append(f"items={self.items}") |
174 | if len(self.progressives) > 0: | ||
175 | parts.append(f"progressives={self.progressives}") | ||
64 | if len(self.rooms) > 0: | 176 | if len(self.rooms) > 0: |
65 | parts.append(f"rooms={self.rooms}") | 177 | parts.append(f"rooms={self.rooms}") |
66 | if len(self.symbols) > 0: | ||
67 | parts.append(f"symbols={self.symbols}") | ||
68 | if len(self.letters) > 0: | 178 | if len(self.letters) > 0: |
69 | parts.append(f"letters={self.letters}") | 179 | parts.append(f"letters={self.letters}") |
180 | if self.cyans: | ||
181 | parts.append(f"cyans=True") | ||
70 | if len(self.or_logic) > 0: | 182 | if len(self.or_logic) > 0: |
71 | parts.append(f"or_logic={self.or_logic}") | 183 | parts.append(f"or_logic={self.or_logic}") |
72 | return f"AccessRequirements({", ".join(parts)})" | 184 | if self.complete_at is not None: |
185 | parts.append(f"complete_at={self.complete_at}") | ||
186 | if len(self.possibilities) > 0: | ||
187 | parts.append(f"possibilities={self.possibilities}") | ||
188 | return "AccessRequirements(" + ", ".join(parts) + ")" | ||
73 | 189 | ||
74 | 190 | ||
75 | class PlayerLocation(NamedTuple): | 191 | class PlayerLocation(NamedTuple): |
@@ -77,13 +193,19 @@ class PlayerLocation(NamedTuple): | |||
77 | reqs: AccessRequirements | 193 | reqs: AccessRequirements |
78 | 194 | ||
79 | 195 | ||
196 | class LetterBehavior(IntEnum): | ||
197 | VANILLA = auto() | ||
198 | ITEM = auto() | ||
199 | UNLOCKED = auto() | ||
200 | |||
201 | |||
80 | class Lingo2PlayerLogic: | 202 | class Lingo2PlayerLogic: |
81 | world: "Lingo2World" | 203 | world: "Lingo2World" |
82 | 204 | ||
83 | locations_by_room: dict[int, list[PlayerLocation]] | 205 | locations_by_room: dict[int, list[PlayerLocation]] |
84 | event_loc_item_by_room: dict[int, dict[str, str]] | 206 | event_loc_item_by_room: dict[int, dict[str, str]] |
85 | 207 | ||
86 | item_by_door: dict[int, str] | 208 | item_by_door: dict[int, tuple[str, int]] |
87 | 209 | ||
88 | panel_reqs: dict[int, AccessRequirements] | 210 | panel_reqs: dict[int, AccessRequirements] |
89 | proxy_reqs: dict[int, dict[str, AccessRequirements]] | 211 | proxy_reqs: dict[int, dict[str, AccessRequirements]] |
@@ -91,6 +213,9 @@ class Lingo2PlayerLogic: | |||
91 | 213 | ||
92 | real_items: list[str] | 214 | real_items: list[str] |
93 | 215 | ||
216 | double_letter_amount: dict[str, int] | ||
217 | goal_room_id: int | ||
218 | |||
94 | def __init__(self, world: "Lingo2World"): | 219 | def __init__(self, world: "Lingo2World"): |
95 | self.world = world | 220 | self.world = world |
96 | self.locations_by_room = {} | 221 | self.locations_by_room = {} |
@@ -100,14 +225,68 @@ class Lingo2PlayerLogic: | |||
100 | self.proxy_reqs = dict() | 225 | self.proxy_reqs = dict() |
101 | self.door_reqs = dict() | 226 | self.door_reqs = dict() |
102 | self.real_items = list() | 227 | self.real_items = list() |
228 | self.double_letter_amount = dict() | ||
229 | |||
230 | if self.world.options.shuffle_doors: | ||
231 | for progressive in world.static_logic.objects.progressives: | ||
232 | for i in range(0, len(progressive.doors)): | ||
233 | self.item_by_door[progressive.doors[i]] = (progressive.name, i + 1) | ||
234 | self.real_items.append(progressive.name) | ||
235 | |||
236 | for door_group in world.static_logic.objects.door_groups: | ||
237 | if door_group.type == data_pb2.DoorGroupType.CONNECTOR: | ||
238 | if not self.world.options.shuffle_doors or self.world.options.shuffle_worldports: | ||
239 | continue | ||
240 | elif door_group.type == data_pb2.DoorGroupType.COLOR_CONNECTOR: | ||
241 | if not self.world.options.shuffle_control_center_colors or self.world.options.shuffle_worldports: | ||
242 | continue | ||
243 | elif door_group.type == data_pb2.DoorGroupType.SHUFFLE_GROUP: | ||
244 | if not self.world.options.shuffle_doors: | ||
245 | continue | ||
246 | else: | ||
247 | continue | ||
248 | |||
249 | for door in door_group.doors: | ||
250 | self.item_by_door[door] = (door_group.name, 1) | ||
251 | |||
252 | self.real_items.append(door_group.name) | ||
103 | 253 | ||
104 | # We iterate through the doors in two parts because it is essential that we determine which doors are shuffled | 254 | # We iterate through the doors in two parts because it is essential that we determine which doors are shuffled |
105 | # before we calculate any access requirements. | 255 | # before we calculate any access requirements. |
106 | for door in world.static_logic.objects.doors: | 256 | for door in world.static_logic.objects.doors: |
107 | if door.type in [data_pb2.DoorType.STANDARD, data_pb2.DoorType.ITEM_ONLY] and self.world.options.shuffle_doors: | 257 | if door.type in [data_pb2.DoorType.EVENT, data_pb2.DoorType.LOCATION_ONLY, data_pb2.DoorType.GRAVESTONE]: |
108 | door_item_name = self.world.static_logic.get_door_item_name(door.id) | 258 | continue |
109 | self.item_by_door[door.id] = door_item_name | 259 | |
110 | self.real_items.append(door_item_name) | 260 | if door.id in self.item_by_door: |
261 | continue | ||
262 | |||
263 | if (door.type in [data_pb2.DoorType.STANDARD, data_pb2.DoorType.ITEM_ONLY] and | ||
264 | not self.world.options.shuffle_doors): | ||
265 | continue | ||
266 | |||
267 | if (door.type == data_pb2.DoorType.CONTROL_CENTER_COLOR and | ||
268 | not self.world.options.shuffle_control_center_colors): | ||
269 | continue | ||
270 | |||
271 | if door.type == data_pb2.DoorType.GALLERY_PAINTING and not self.world.options.shuffle_gallery_paintings: | ||
272 | continue | ||
273 | |||
274 | door_item_name = self.world.static_logic.get_door_item_name(door) | ||
275 | self.item_by_door[door.id] = (door_item_name, 1) | ||
276 | self.real_items.append(door_item_name) | ||
277 | |||
278 | # We handle cyan_door_behavior = Item after door shuffle, because cyan doors that are impacted by door shuffle | ||
279 | # should be exempt from cyan_door_behavior. | ||
280 | if world.options.cyan_door_behavior == CyanDoorBehavior.option_item: | ||
281 | for door_group in world.static_logic.objects.door_groups: | ||
282 | if door_group.type != data_pb2.DoorGroupType.CYAN_DOORS: | ||
283 | continue | ||
284 | |||
285 | for door in door_group.doors: | ||
286 | if not door in self.item_by_door: | ||
287 | self.item_by_door[door] = (door_group.name, 1) | ||
288 | |||
289 | self.real_items.append(door_group.name) | ||
111 | 290 | ||
112 | for door in world.static_logic.objects.doors: | 291 | for door in world.static_logic.objects.doors: |
113 | if door.type in [data_pb2.DoorType.STANDARD, data_pb2.DoorType.LOCATION_ONLY, data_pb2.DoorType.GRAVESTONE]: | 292 | if door.type in [data_pb2.DoorType.STANDARD, data_pb2.DoorType.LOCATION_ONLY, data_pb2.DoorType.GRAVESTONE]: |
@@ -117,31 +296,57 @@ class Lingo2PlayerLogic: | |||
117 | for letter in world.static_logic.objects.letters: | 296 | for letter in world.static_logic.objects.letters: |
118 | self.locations_by_room.setdefault(letter.room_id, []).append(PlayerLocation(letter.ap_id, | 297 | self.locations_by_room.setdefault(letter.room_id, []).append(PlayerLocation(letter.ap_id, |
119 | AccessRequirements())) | 298 | AccessRequirements())) |
120 | 299 | behavior = self.get_letter_behavior(letter.key, letter.level2) | |
121 | letter_name = f"{letter.key.upper()}{'2' if letter.level2 else '1'}" | 300 | if behavior == LetterBehavior.VANILLA: |
122 | event_name = f"{letter_name} (Collected)" | 301 | if not world.for_tracker: |
123 | self.event_loc_item_by_room.setdefault(letter.room_id, {})[event_name] = letter.key.upper() | 302 | letter_name = f"{letter.key.upper()}{'2' if letter.level2 else '1'}" |
124 | 303 | event_name = f"{letter_name} (Collected)" | |
125 | if letter.level2: | 304 | self.event_loc_item_by_room.setdefault(letter.room_id, {})[event_name] = letter.key.upper() |
126 | event_name = f"{letter_name} (Double Collected)" | 305 | |
127 | self.event_loc_item_by_room.setdefault(letter.room_id, {})[event_name] = letter.key.upper() | 306 | if letter.level2: |
307 | event_name = f"{letter_name} (Double Collected)" | ||
308 | self.event_loc_item_by_room.setdefault(letter.room_id, {})[event_name] = letter.key.upper() | ||
309 | elif behavior == LetterBehavior.ITEM: | ||
310 | self.real_items.append(letter.key.upper()) | ||
311 | |||
312 | if behavior != LetterBehavior.UNLOCKED: | ||
313 | self.double_letter_amount[letter.key.upper()] = self.double_letter_amount.get(letter.key.upper(), 0) + 1 | ||
128 | 314 | ||
129 | for mastery in world.static_logic.objects.masteries: | 315 | for mastery in world.static_logic.objects.masteries: |
130 | self.locations_by_room.setdefault(mastery.room_id, []).append(PlayerLocation(mastery.ap_id, | 316 | self.locations_by_room.setdefault(mastery.room_id, []).append(PlayerLocation(mastery.ap_id, |
131 | AccessRequirements())) | 317 | AccessRequirements())) |
132 | 318 | ||
133 | for ending in world.static_logic.objects.endings: | 319 | for ending in world.static_logic.objects.endings: |
134 | self.locations_by_room.setdefault(ending.room_id, []).append(PlayerLocation(ending.ap_id, | 320 | # Don't create a location for your selected ending, and never create a location for White Ending. |
135 | AccessRequirements())) | 321 | if world.options.victory_condition.current_key.removesuffix("_ending").upper() != ending.name\ |
322 | and ending.name != "WHITE": | ||
323 | self.locations_by_room.setdefault(ending.room_id, []).append(PlayerLocation(ending.ap_id, | ||
324 | AccessRequirements())) | ||
136 | 325 | ||
137 | event_name = f"{ending.name.capitalize()} Ending (Achieved)" | 326 | event_name = f"{ending.name.capitalize()} Ending (Achieved)" |
138 | item_name = event_name | 327 | item_name = event_name |
139 | 328 | ||
140 | if world.options.victory_condition.current_key.removesuffix("_ending").upper() == ending.name: | 329 | if world.options.victory_condition.current_key.removesuffix("_ending").upper() == ending.name: |
141 | item_name = "Victory" | 330 | item_name = "Victory" |
331 | self.goal_room_id = ending.room_id | ||
142 | 332 | ||
143 | self.event_loc_item_by_room.setdefault(ending.room_id, {})[event_name] = item_name | 333 | self.event_loc_item_by_room.setdefault(ending.room_id, {})[event_name] = item_name |
144 | 334 | ||
335 | if self.world.options.keyholder_sanity: | ||
336 | for keyholder in world.static_logic.objects.keyholders: | ||
337 | if keyholder.HasField("key"): | ||
338 | reqs = AccessRequirements() | ||
339 | |||
340 | if self.get_letter_behavior(keyholder.key, False) != LetterBehavior.UNLOCKED: | ||
341 | reqs.letters[keyholder.key.upper()] = 1 | ||
342 | |||
343 | self.locations_by_room.setdefault(keyholder.room_id, []).append(PlayerLocation(keyholder.ap_id, | ||
344 | reqs)) | ||
345 | |||
346 | if self.world.options.shuffle_symbols: | ||
347 | for symbol_name in SYMBOL_ITEMS.values(): | ||
348 | self.real_items.append(symbol_name) | ||
349 | |||
145 | def get_panel_reqs(self, panel_id: int, answer: str | None) -> AccessRequirements: | 350 | def get_panel_reqs(self, panel_id: int, answer: str | None) -> AccessRequirements: |
146 | if answer is None: | 351 | if answer is None: |
147 | if panel_id not in self.panel_reqs: | 352 | if panel_id not in self.panel_reqs: |
@@ -161,28 +366,38 @@ class Lingo2PlayerLogic: | |||
161 | reqs.rooms.add(self.world.static_logic.get_room_region_name(panel.room_id)) | 366 | reqs.rooms.add(self.world.static_logic.get_room_region_name(panel.room_id)) |
162 | 367 | ||
163 | if answer is not None: | 368 | if answer is not None: |
164 | reqs.add_solution(answer) | 369 | self.add_solution_reqs(reqs, answer) |
165 | elif len(panel.proxies) > 0: | 370 | elif len(panel.proxies) > 0: |
166 | possibilities = [] | 371 | possibilities = [] |
372 | already_filled = False | ||
167 | 373 | ||
168 | for proxy in panel.proxies: | 374 | for proxy in panel.proxies: |
169 | proxy_reqs = AccessRequirements() | 375 | proxy_reqs = AccessRequirements() |
170 | proxy_reqs.add_solution(proxy.answer) | 376 | self.add_solution_reqs(proxy_reqs, proxy.answer) |
171 | 377 | ||
172 | possibilities.append(proxy_reqs) | 378 | if not proxy_reqs.is_empty(): |
379 | possibilities.append(proxy_reqs) | ||
380 | else: | ||
381 | already_filled = True | ||
382 | break | ||
173 | 383 | ||
174 | if not any(proxy.answer == panel.answer for proxy in panel.proxies): | 384 | if not already_filled and not any(proxy.answer == panel.answer for proxy in panel.proxies): |
175 | proxy_reqs = AccessRequirements() | 385 | proxy_reqs = AccessRequirements() |
176 | proxy_reqs.add_solution(panel.answer) | 386 | self.add_solution_reqs(proxy_reqs, panel.answer) |
177 | 387 | ||
178 | possibilities.append(proxy_reqs) | 388 | if not proxy_reqs.is_empty(): |
389 | possibilities.append(proxy_reqs) | ||
390 | else: | ||
391 | already_filled = True | ||
179 | 392 | ||
180 | reqs.or_logic.append(possibilities) | 393 | if not already_filled: |
394 | reqs.or_logic.append(possibilities) | ||
181 | else: | 395 | else: |
182 | reqs.add_solution(panel.answer) | 396 | self.add_solution_reqs(reqs, panel.answer) |
183 | 397 | ||
184 | for symbol in panel.symbols: | 398 | if self.world.options.shuffle_symbols: |
185 | reqs.symbols.add(symbol) | 399 | for symbol in panel.symbols: |
400 | reqs.items.add(SYMBOL_ITEMS.get(symbol)) | ||
186 | 401 | ||
187 | if panel.HasField("required_door"): | 402 | if panel.HasField("required_door"): |
188 | door_reqs = self.get_door_open_reqs(panel.required_door) | 403 | door_reqs = self.get_door_open_reqs(panel.required_door) |
@@ -205,22 +420,46 @@ class Lingo2PlayerLogic: | |||
205 | door = self.world.static_logic.objects.doors[door_id] | 420 | door = self.world.static_logic.objects.doors[door_id] |
206 | reqs = AccessRequirements() | 421 | reqs = AccessRequirements() |
207 | 422 | ||
208 | # TODO: control_center_color, switches | ||
209 | if not door.HasField("complete_at") or door.complete_at == 0: | 423 | if not door.HasField("complete_at") or door.complete_at == 0: |
210 | for proxy in door.panels: | 424 | for proxy in door.panels: |
211 | panel_reqs = self.get_panel_reqs(proxy.panel, proxy.answer if proxy.HasField("answer") else None) | 425 | panel_reqs = self.get_panel_reqs(proxy.panel, proxy.answer if proxy.HasField("answer") else None) |
212 | reqs.merge(panel_reqs) | 426 | reqs.merge(panel_reqs) |
213 | elif door.complete_at == 1: | 427 | elif door.complete_at == 1: |
214 | reqs.or_logic.append([self.get_panel_reqs(proxy.panel, | 428 | disjunction = [] |
215 | proxy.answer if proxy.HasField("answer") else None) | 429 | for proxy in door.panels: |
216 | for proxy in door.panels]) | 430 | proxy_reqs = self.get_panel_reqs(proxy.panel, proxy.answer if proxy.HasField("answer") else None) |
431 | if proxy_reqs.is_empty(): | ||
432 | disjunction.clear() | ||
433 | break | ||
434 | else: | ||
435 | disjunction.append(proxy_reqs) | ||
436 | if len(disjunction) > 0: | ||
437 | reqs.or_logic.append(disjunction) | ||
217 | else: | 438 | else: |
218 | # TODO: Handle complete_at > 1 | 439 | reqs.complete_at = door.complete_at |
219 | pass | 440 | for proxy in door.panels: |
441 | panel_reqs = self.get_panel_reqs(proxy.panel, proxy.answer if proxy.HasField("answer") else None) | ||
442 | reqs.possibilities.append(panel_reqs) | ||
443 | |||
444 | if door.HasField("control_center_color"): | ||
445 | # TODO: Logic for ensuring two CC states aren't needed at once. | ||
446 | reqs.rooms.add("Control Center - Main Area") | ||
447 | self.add_solution_reqs(reqs, door.control_center_color) | ||
448 | |||
449 | if door.double_letters: | ||
450 | if self.world.options.cyan_door_behavior == CyanDoorBehavior.option_collect_h2: | ||
451 | reqs.rooms.add("The Repetitive - Main Room") | ||
452 | elif self.world.options.cyan_door_behavior == CyanDoorBehavior.option_any_double_letter: | ||
453 | if self.world.options.shuffle_letters != ShuffleLetters.option_unlocked: | ||
454 | reqs.cyans = True | ||
455 | elif self.world.options.cyan_door_behavior == CyanDoorBehavior.option_item: | ||
456 | # There shouldn't be any locations that are cyan doors. | ||
457 | pass | ||
220 | 458 | ||
221 | for keyholder_uses in door.keyholders: | 459 | for keyholder_uses in door.keyholders: |
222 | key_name = keyholder_uses.key.upper() | 460 | key_name = keyholder_uses.key.upper() |
223 | if key_name not in reqs.letters: | 461 | if (self.get_letter_behavior(keyholder_uses.key, False) != LetterBehavior.UNLOCKED |
462 | and key_name not in reqs.letters): | ||
224 | reqs.letters[key_name] = 1 | 463 | reqs.letters[key_name] = 1 |
225 | 464 | ||
226 | keyholder = self.world.static_logic.objects.keyholders[keyholder_uses.keyholder] | 465 | keyholder = self.world.static_logic.objects.keyholders[keyholder_uses.keyholder] |
@@ -229,10 +468,20 @@ class Lingo2PlayerLogic: | |||
229 | for room in door.rooms: | 468 | for room in door.rooms: |
230 | reqs.rooms.add(self.world.static_logic.get_room_region_name(room)) | 469 | reqs.rooms.add(self.world.static_logic.get_room_region_name(room)) |
231 | 470 | ||
471 | for ending_id in door.endings: | ||
472 | ending = self.world.static_logic.objects.endings[ending_id] | ||
473 | |||
474 | if self.world.options.victory_condition.current_key.removesuffix("_ending").upper() == ending.name: | ||
475 | reqs.items.add("Victory") | ||
476 | else: | ||
477 | reqs.items.add(f"{ending.name.capitalize()} Ending (Achieved)") | ||
478 | |||
232 | for sub_door_id in door.doors: | 479 | for sub_door_id in door.doors: |
233 | sub_reqs = self.get_door_open_reqs(sub_door_id) | 480 | sub_reqs = self.get_door_open_reqs(sub_door_id) |
234 | reqs.merge(sub_reqs) | 481 | reqs.merge(sub_reqs) |
235 | 482 | ||
483 | reqs.simplify() | ||
484 | |||
236 | return reqs | 485 | return reqs |
237 | 486 | ||
238 | # This gets the requirements to open a door within the world. When a door is shuffled, this means having the item | 487 | # This gets the requirements to open a door within the world. When a door is shuffled, this means having the item |
@@ -240,8 +489,50 @@ class Lingo2PlayerLogic: | |||
240 | def get_door_open_reqs(self, door_id: int) -> AccessRequirements: | 489 | def get_door_open_reqs(self, door_id: int) -> AccessRequirements: |
241 | if door_id in self.item_by_door: | 490 | if door_id in self.item_by_door: |
242 | reqs = AccessRequirements() | 491 | reqs = AccessRequirements() |
243 | reqs.items.add(self.item_by_door.get(door_id)) | 492 | |
493 | item_name, amount = self.item_by_door.get(door_id) | ||
494 | if amount == 1: | ||
495 | reqs.items.add(item_name) | ||
496 | else: | ||
497 | reqs.progressives[item_name] = amount | ||
244 | 498 | ||
245 | return reqs | 499 | return reqs |
246 | else: | 500 | else: |
247 | return self.get_door_reqs(door_id) | 501 | return self.get_door_reqs(door_id) |
502 | |||
503 | def get_letter_behavior(self, letter: str, level2: bool) -> LetterBehavior: | ||
504 | if self.world.options.shuffle_letters == ShuffleLetters.option_unlocked: | ||
505 | return LetterBehavior.UNLOCKED | ||
506 | |||
507 | if self.world.options.shuffle_letters in [ShuffleLetters.option_vanilla_cyan, ShuffleLetters.option_item_cyan]: | ||
508 | if level2: | ||
509 | if self.world.options.shuffle_letters == ShuffleLetters.option_vanilla_cyan: | ||
510 | return LetterBehavior.VANILLA | ||
511 | else: | ||
512 | return LetterBehavior.ITEM | ||
513 | else: | ||
514 | return LetterBehavior.UNLOCKED | ||
515 | |||
516 | if not level2 and letter in ["h", "i", "n", "t"]: | ||
517 | return LetterBehavior.UNLOCKED | ||
518 | |||
519 | if self.world.options.shuffle_letters == ShuffleLetters.option_progressive: | ||
520 | return LetterBehavior.ITEM | ||
521 | |||
522 | return LetterBehavior.VANILLA | ||
523 | |||
524 | def add_solution_reqs(self, reqs: AccessRequirements, solution: str): | ||
525 | histogram = calculate_letter_histogram(solution) | ||
526 | |||
527 | for l, a in histogram.items(): | ||
528 | needed = min(a, 2) | ||
529 | level2 = (needed == 2) | ||
530 | |||
531 | if level2 and self.get_letter_behavior(l.lower(), True) == LetterBehavior.UNLOCKED: | ||
532 | needed = 1 | ||
533 | |||
534 | if self.get_letter_behavior(l.lower(), False) == LetterBehavior.UNLOCKED: | ||
535 | needed = needed - 1 | ||
536 | |||
537 | if needed > 0: | ||
538 | reqs.letters[l] = max(reqs.letters.get(l, 0), needed) | ||