about summary refs log tree commit diff stats
path: root/src/tracker_state.cpp
blob: cc941efef032bb40fb5bd0682623ced7f32b822c (plain) (blame)
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
#include "tracker_state.h"

#include <list>
#include <map>
#include <mutex>
#include <set>
#include <sstream>
#include <tuple>

#include "ap_state.h"
#include "game_data.h"

namespace {

struct TrackerState {
  std::map<int, bool> reachability;
  std::mutex reachability_mutex;
};

enum Decision { kYes, kNo, kMaybe };

TrackerState& GetState() {
  static TrackerState* instance = new TrackerState();
  return *instance;
}

struct StateCalculatorOptions {
  std::string start = "Menu";
  bool pilgrimage = false;
};

class StateCalculator {
 public:
  StateCalculator() = default;

  explicit StateCalculator(StateCalculatorOptions options)
      : options_(options) {}

  void Calculate() {
    std::list<int> panel_boundary;
    std::list<Exit> flood_boundary;
    flood_boundary.push_back(
        {.destination_room = GD_GetRoomByName(options_.start)});

    bool reachable_changed = true;
    while (reachable_changed) {
      reachable_changed = false;

      std::list<int> new_panel_boundary;
      for (int panel_id : panel_boundary) {
        if (solveable_panels_.count(panel_id)) {
          continue;
        }

        Decision panel_reachable = IsPanelReachable(panel_id);
        if (panel_reachable == kYes) {
          solveable_panels_.insert(panel_id);
          reachable_changed = true;
        } else if (panel_reachable == kMaybe) {
          new_panel_boundary.push_back(panel_id);
        }
      }

      std::list<Exit> new_boundary;
      for (const Exit& room_exit : flood_boundary) {
        if (reachable_rooms_.count(room_exit.destination_room)) {
          continue;
        }

        bool valid_transition = false;

        Decision exit_usable = IsExitUsable(room_exit);
        if (exit_usable == kYes) {
          valid_transition = true;
        } else if (exit_usable == kMaybe) {
          new_boundary.push_back(room_exit);
        }

        if (valid_transition) {
          reachable_rooms_.insert(room_exit.destination_room);
          reachable_changed = true;

          const Room& room_obj = GD_GetRoom(room_exit.destination_room);
          for (const Exit& out_edge : room_obj.exits) {
            if (out_edge.type != EntranceType::kPainting ||
                !AP_IsPaintingShuffle()) {
              new_boundary.push_back(out_edge);
            }
          }

          if (AP_IsPaintingShuffle()) {
            for (const PaintingExit& out_edge : room_obj.paintings) {
              if (AP_GetPaintingMapping().count(out_edge.id)) {
                Exit painting_exit;
                painting_exit.destination_room = GD_GetRoomForPainting(
                    AP_GetPaintingMapping().at(out_edge.id));
                painting_exit.door = out_edge.door;

                new_boundary.push_back(painting_exit);
              }
            }
          }

          if (AP_HasEarlyColorHallways() && room_obj.name == "Starting Room") {
            new_boundary.push_back(
                {.destination_room = GD_GetRoomByName("Outside The Undeterred"),
                 .type = EntranceType::kPainting});
          }

          if (AP_IsPilgrimageEnabled()) {
            if (room_obj.name == "Hub Room") {
              new_boundary.push_back(
                  {.destination_room = GD_GetRoomByName("Pilgrim Antechamber"),
                   .type = EntranceType::kPilgrimage});
            }
          } else {
            if (room_obj.name == "Starting Room") {
              new_boundary.push_back(
                  {.destination_room = GD_GetRoomByName("Pilgrim Antechamber"),
                   .door =
                       GD_GetDoorByName("Pilgrim Antechamber - Sun Painting"),
                   .type = EntranceType::kPainting});
            }
          }

          for (int panel_id : room_obj.panels) {
            new_panel_boundary.push_back(panel_id);
          }
        }
      }

      flood_boundary = new_boundary;
      panel_boundary = new_panel_boundary;
    }
  }

  const std::set<int>& GetReachableRooms() const { return reachable_rooms_; }

  const std::set<int>& GetSolveablePanels() const { return solveable_panels_; }

 private:
  Decision IsDoorReachable(int door_id) {
    const Door& door_obj = GD_GetDoor(door_id);

    if (!AP_IsPilgrimageEnabled() &&
        door_obj.item_name == "Pilgrim Room - Sun Painting") {
      return AP_HasItem(door_obj.ap_item_id) ? kYes : kNo;
    } else if (AP_GetDoorShuffleMode() == kNO_DOORS || door_obj.skip_item) {
      if (!reachable_rooms_.count(door_obj.room)) {
        return kMaybe;
      }

      for (int panel_id : door_obj.panels) {
        if (!solveable_panels_.count(panel_id)) {
          return kMaybe;
        }
      }

      return kYes;
    } else if (AP_GetDoorShuffleMode() == kSIMPLE_DOORS &&
               !door_obj.group_name.empty()) {
      return AP_HasItem(door_obj.group_ap_item_id) ? kYes : kNo;
    } else {
      bool has_item = AP_HasItem(door_obj.ap_item_id);

      if (!has_item) {
        for (const ProgressiveRequirement& prog_req : door_obj.progressives) {
          if (AP_HasItem(prog_req.ap_item_id, prog_req.quantity)) {
            has_item = true;
            break;
          }
        }
      }

      return has_item ? kYes : kNo;
    }
  }

  Decision IsPanelReachable(int panel_id) {
    const Panel& panel_obj = GD_GetPanel(panel_id);

    if (!reachable_rooms_.count(panel_obj.room)) {
      return kMaybe;
    }

    if (panel_obj.name == "THE MASTER") {
      int achievements_accessible = 0;

      for (int achieve_id : GD_GetAchievementPanels()) {
        if (solveable_panels_.count(achieve_id)) {
          achievements_accessible++;

          if (achievements_accessible >= AP_GetMasteryRequirement()) {
            break;
          }
        }
      }

      return (achievements_accessible >= AP_GetMasteryRequirement()) ? kYes
                                                                     : kMaybe;
    }

    if ((panel_obj.name == "ANOTHER TRY" || panel_obj.name == "LEVEL 2") &&
        AP_GetLevel2Requirement() > 1) {
      int counting_panels_accessible = 0;

      for (int solved_panel_id : solveable_panels_) {
        const Panel& solved_panel = GD_GetPanel(solved_panel_id);

        if (!solved_panel.non_counting) {
          counting_panels_accessible++;
        }
      }

      return (counting_panels_accessible >= AP_GetLevel2Requirement() - 1)
                 ? kYes
                 : kMaybe;
    }

    for (int room_id : panel_obj.required_rooms) {
      if (!reachable_rooms_.count(room_id)) {
        return kMaybe;
      }
    }

    for (int door_id : panel_obj.required_doors) {
      Decision door_reachable = IsDoorReachable(door_id);
      if (door_reachable == kNo) {
        const Door& door_obj = GD_GetDoor(door_id);
        return (door_obj.is_event || AP_GetDoorShuffleMode() == kNO_DOORS)
                   ? kMaybe
                   : kNo;
      } else if (door_reachable == kMaybe) {
        return kMaybe;
      }
    }

    for (int panel_id : panel_obj.required_panels) {
      if (!solveable_panels_.count(panel_id)) {
        return kMaybe;
      }
    }

    if (AP_IsColorShuffle()) {
      for (LingoColor color : panel_obj.colors) {
        if (!AP_HasItem(GD_GetItemIdForColor(color))) {
          return kNo;
        }
      }
    }

    return kYes;
  }

  Decision IsExitUsable(const Exit& room_exit) {
    if (room_exit.type == EntranceType::kPilgrimage) {
      if (options_.pilgrimage || !AP_IsPilgrimageEnabled()) {
        return kNo;
      }

      static const std::vector<std::tuple<std::string, std::string>>
          pilgrimage_pairs = {
              {"Crossroads", "Hot Crusts Area"},
              // {"Orange Tower Third Floor", "Orange Tower Third Floor"},
              {"Outside The Initiated", "Orange Tower First Floor"},
              {"Outside The Undeterred", "Orange Tower Fourth Floor"},
              {"Color Hunt", "Outside The Agreeable"}};

      for (const auto& [from_room, to_room] : pilgrimage_pairs) {
        StateCalculator pilgrimage_calculator(
            {.start = from_room, .pilgrimage = true});
        pilgrimage_calculator.Calculate();

        if (!pilgrimage_calculator.GetReachableRooms().count(
                GD_GetRoomByName(to_room))) {
          return kMaybe;
        }
      }

      return kYes;
    }

    if (options_.pilgrimage) {
      if (room_exit.type == EntranceType::kWarp ||
          room_exit.type == EntranceType::kSunwarp) {
        return kNo;
      }
    }

    if (room_exit.type == EntranceType::kSunwarp) {
      if (AP_GetSunwarpAccess() == kSUNWARP_ACCESS_NORMAL) {
        return kYes;
      } else if (AP_GetSunwarpAccess() == kSUNWARP_ACCESS_DISABLED) {
        return kNo;
      }
    }

    if (room_exit.door.has_value()) {
      return IsDoorReachable(*room_exit.door);
    }

    return kYes;
  }

  StateCalculatorOptions options_;

  std::set<int> reachable_rooms_;
  std::set<int> solveable_panels_;
};

}  // namespace

void RecalculateReachability() {
  StateCalculator state_calculator;
  state_calculator.Calculate();

  const std::set<int>& reachable_rooms = state_calculator.GetReachableRooms();
  const std::set<int>& solveable_panels = state_calculator.GetSolveablePanels();

  std::map<int, bool> new_reachability;
  for (const MapArea& map_area : GD_GetMapAreas()) {
    for (size_t section_id = 0; section_id < map_area.locations.size();
         section_id++) {
      const Location& location_section = map_area.locations.at(section_id);
      bool reachable = reachable_rooms.count(location_section.room);
      if (reachable) {
        for (int panel_id : location_section.panels) {
          reachable &= (solveable_panels.count(panel_id) == 1);
        }
      }

      new_reachability[location_section.ap_location_id] = reachable;
    }
  }

  {
    std::lock_guard reachability_guard(GetState().reachability_mutex);
    std::swap(GetState().reachability, new_reachability);
  }
}

bool IsLocationReachable(int location_id) {
  std::lock_guard reachability_guard(GetState().reachability_mutex);

  if (GetState().reachability.count(location_id)) {
    return GetState().reachability.at(location_id);
  } else {
    return false;
  }
}