search

Zannick / logic-graph

Tools for video game logic representation and analysis, particularly routing and beatability checks for speedruns and randomizers.
MIT License
3 stars 0 forks source link

greedy search doesn't ever pick the right action #37

Closed Zannick closed 1 year ago

Zannick commented 1 year ago

It only ever picks the nearest spot with available actions, which, when there are global actions, will almost certainly never be one that really progresses. We will have to try every action, and pick the shortest one for which action_unlocked_anything returns true.

Zannick commented 1 year ago

Even with action_unlocked_anything returning only when the action produces new locations, it still cannot finish. Likely we will end up removing the greedy search. The problem is that this makes it harder to check whether we can beat the game in can_win (from examining whether we can skip a location).