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

Improve memory usage of access_check_after_actions #183

Closed Zannick closed 1 week ago

Zannick commented 2 weeks ago

On one hand, perhaps the correct move is to reduce the depth we allow, but maybe there's a way we can find a route from a prior solution that doesn't rely on the A* method (or on saving all the states we've seen, etc).

Zannick commented 1 week ago

The unfortunate thing is that these aren't just a matter of max states evaluated but of states generated into the temp heap. My last cli run needed to evaluate 3k states, but had 27k left in the heap at the end of it.

We should have some way to discard states we aren't likely to use, perhaps states that leave the goal community (which requires that we expand community to all spots). What would we do with states that haven't reached the goal community yet, though, once we have a state that gets there? Or perhaps we could just evict states since we have a maximum iteration limit anyway.