Back

I don't think it's common that randomizers take a particularly math-y solution to the problem of reachability, I think it's usually a brute-force solution since game graphs are small enough (i.e. O(100) nodes).

For instance, here's where location validation happens in the OoT randomizer, it's "just" going through each entrance and checking them one by one

https://github.com/OoTRandomizer/OoT-Randomizer/blob/5a604ebda43fc0d56e813503666bc0d61bea5185/EntranceShuffle.py#L921-L1038