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

Make better use of routes #89

Closed Zannick closed 1 year ago

Zannick commented 1 year ago

Thanks to the next caching of processed states, we have to get every possible single-step state before we can add a new state, so the process to take a route and turn it into a sequence of states to start from would be:

  1. Start at the first state.
  2. Get all the next states from the current state.
  3. Find the one that corresponds to the next history step in the route, remove it from the list.
  4. Extend all the other states into the queue.
  5. Record this state, then go back to step 1 using this state.