diff options
Diffstat (limited to 'apworld/player_logic.py')
-rw-r--r-- | apworld/player_logic.py | 97 |
1 files changed, 93 insertions, 4 deletions
diff --git a/apworld/player_logic.py b/apworld/player_logic.py index 42b36e6..8e2a523 100644 --- a/apworld/player_logic.py +++ b/apworld/player_logic.py | |||
@@ -30,6 +30,11 @@ class AccessRequirements: | |||
30 | # This is an AND of ORs. | 30 | # This is an AND of ORs. |
31 | or_logic: list[list["AccessRequirements"]] | 31 | or_logic: list[list["AccessRequirements"]] |
32 | 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 | |||
33 | def __init__(self): | 38 | def __init__(self): |
34 | self.items = set() | 39 | self.items = set() |
35 | self.progressives = dict() | 40 | self.progressives = dict() |
@@ -37,6 +42,20 @@ class AccessRequirements: | |||
37 | self.letters = dict() | 42 | self.letters = dict() |
38 | self.cyans = False | 43 | self.cyans = False |
39 | self.or_logic = list() | 44 | self.or_logic = list() |
45 | self.complete_at = None | ||
46 | self.possibilities = list() | ||
47 | |||
48 | def copy(self) -> "AccessRequirements": | ||
49 | reqs = AccessRequirements() | ||
50 | reqs.items = self.items.copy() | ||
51 | reqs.progressives = self.progressives.copy() | ||
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 | ||
40 | 59 | ||
41 | def merge(self, other: "AccessRequirements"): | 60 | def merge(self, other: "AccessRequirements"): |
42 | for item in other.items: | 61 | for item in other.items: |
@@ -56,9 +75,69 @@ class AccessRequirements: | |||
56 | for disjunction in other.or_logic: | 75 | for disjunction in other.or_logic: |
57 | self.or_logic.append(disjunction) | 76 | self.or_logic.append(disjunction) |
58 | 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 | |||
59 | def is_empty(self) -> bool: | 101 | def is_empty(self) -> bool: |
60 | return (len(self.items) == 0 and len(self.progressives) == 0 and len(self.rooms) == 0 and len(self.letters) == 0 | 102 | return (len(self.items) == 0 and len(self.progressives) == 0 and len(self.rooms) == 0 and len(self.letters) == 0 |
61 | and not self.cyans and len(self.or_logic) == 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 | sub_reqs.letters = {l: v for l, v in sub_reqs.letters.items() if self.letters.get(l, 0) < v} | ||
118 | |||
119 | self.or_logic = [] | ||
120 | for disjunction in old_or_logic: | ||
121 | new_disjunction = [] | ||
122 | for ssr in disjunction: | ||
123 | remove_redundant(ssr) | ||
124 | if not ssr.is_empty(): | ||
125 | new_disjunction.append(ssr) | ||
126 | else: | ||
127 | new_disjunction.clear() | ||
128 | break | ||
129 | if len(new_disjunction) == 1: | ||
130 | self.merge(new_disjunction[0]) | ||
131 | resimplify = True | ||
132 | elif len(new_disjunction) > 1: | ||
133 | if all(cjr == new_disjunction[0] for cjr in new_disjunction): | ||
134 | self.merge(new_disjunction[0]) | ||
135 | resimplify = True | ||
136 | else: | ||
137 | self.or_logic.append(new_disjunction) | ||
138 | |||
139 | if resimplify: | ||
140 | self.simplify() | ||
62 | 141 | ||
63 | def __repr__(self): | 142 | def __repr__(self): |
64 | parts = [] | 143 | parts = [] |
@@ -74,6 +153,10 @@ class AccessRequirements: | |||
74 | parts.append(f"cyans=True") | 153 | parts.append(f"cyans=True") |
75 | if len(self.or_logic) > 0: | 154 | if len(self.or_logic) > 0: |
76 | parts.append(f"or_logic={self.or_logic}") | 155 | parts.append(f"or_logic={self.or_logic}") |
156 | if self.complete_at is not None: | ||
157 | parts.append(f"complete_at={self.complete_at}") | ||
158 | if len(self.possibilities) > 0: | ||
159 | parts.append(f"possibilities={self.possibilities}") | ||
77 | return f"AccessRequirements({", ".join(parts)})" | 160 | return f"AccessRequirements({", ".join(parts)})" |
78 | 161 | ||
79 | 162 | ||
@@ -156,6 +239,9 @@ class Lingo2PlayerLogic: | |||
156 | not self.world.options.shuffle_control_center_colors): | 239 | not self.world.options.shuffle_control_center_colors): |
157 | continue | 240 | continue |
158 | 241 | ||
242 | if door.type == data_pb2.DoorType.GALLERY_PAINTING and not self.world.options.shuffle_gallery_paintings: | ||
243 | continue | ||
244 | |||
159 | door_item_name = self.world.static_logic.get_door_item_name(door) | 245 | door_item_name = self.world.static_logic.get_door_item_name(door) |
160 | self.item_by_door[door.id] = (door_item_name, 1) | 246 | self.item_by_door[door.id] = (door_item_name, 1) |
161 | self.real_items.append(door_item_name) | 247 | self.real_items.append(door_item_name) |
@@ -306,7 +392,6 @@ class Lingo2PlayerLogic: | |||
306 | door = self.world.static_logic.objects.doors[door_id] | 392 | door = self.world.static_logic.objects.doors[door_id] |
307 | reqs = AccessRequirements() | 393 | reqs = AccessRequirements() |
308 | 394 | ||
309 | # TODO: lavender_cubes, endings | ||
310 | if not door.HasField("complete_at") or door.complete_at == 0: | 395 | if not door.HasField("complete_at") or door.complete_at == 0: |
311 | for proxy in door.panels: | 396 | for proxy in door.panels: |
312 | panel_reqs = self.get_panel_reqs(proxy.panel, proxy.answer if proxy.HasField("answer") else None) | 397 | panel_reqs = self.get_panel_reqs(proxy.panel, proxy.answer if proxy.HasField("answer") else None) |
@@ -323,8 +408,10 @@ class Lingo2PlayerLogic: | |||
323 | if len(disjunction) > 0: | 408 | if len(disjunction) > 0: |
324 | reqs.or_logic.append(disjunction) | 409 | reqs.or_logic.append(disjunction) |
325 | else: | 410 | else: |
326 | # TODO: Handle complete_at > 1 | 411 | reqs.complete_at = door.complete_at |
327 | pass | 412 | for proxy in door.panels: |
413 | panel_reqs = self.get_panel_reqs(proxy.panel, proxy.answer if proxy.HasField("answer") else None) | ||
414 | reqs.possibilities.append(panel_reqs) | ||
328 | 415 | ||
329 | if door.HasField("control_center_color"): | 416 | if door.HasField("control_center_color"): |
330 | # TODO: Logic for ensuring two CC states aren't needed at once. | 417 | # TODO: Logic for ensuring two CC states aren't needed at once. |
@@ -365,6 +452,8 @@ class Lingo2PlayerLogic: | |||
365 | sub_reqs = self.get_door_open_reqs(sub_door_id) | 452 | sub_reqs = self.get_door_open_reqs(sub_door_id) |
366 | reqs.merge(sub_reqs) | 453 | reqs.merge(sub_reqs) |
367 | 454 | ||
455 | reqs.simplify() | ||
456 | |||
368 | return reqs | 457 | return reqs |
369 | 458 | ||
370 | # This gets the requirements to open a door within the world. When a door is shuffled, this means having the item | 459 | # This gets the requirements to open a door within the world. When a door is shuffled, this means having the item |