Open Zannick opened 11 months ago
The algorithm would work like this:
This should work with a correct value of $A$.
If we want this to be run by the analyzer, we could create such a check with these builtins:
Transforming this into a precalculated map in the python will be expensive ( $O(S^3)$ ) if it's a global action. In the analyzer it would run a lot, but a lot more lazily (only as each possible triple is visited). I wonder if we should add caching for expensive functions (but this one is just a small amount of math, so probably not worth it).
While this should work, it certainly won't cover all cases. The angle of the portal attraction used in the main glitchless strat is about 27 degrees from Indra at the final point, and probably works mostly because the attraction begins early (it doesn't work sometimes if you start it too low in the room) and the drone's gravitational pull is stronger enough with Indra's distance. This and others will probably have to be hardcoded actions.
Renaming to better fit the remaining scope of the problem.
AV2's portal attraction has some unusual behavior when used with the player figures in different places (normally there's only one figure when you have the attractor). Ideally we don't manually include all the valid spots Indra could be where moving the portal would work to a given spot in the drone's area. So either we:
match
function that lists the valid spots