Single Comment

The problem with the Bowman is that n on an oblique leap is only recognized as multi-path lame for single-leg moves, in which case it triggers some special code during the parsing of the move to convert the leap into a sequence of steps in all possible geometrically shortest ways. In multi-leg moves it still only results into setting of a flag on the leg in question to indicate it is lame. When the move generator sees that flag it only tests one path for being empty, and since that path is a repetition of identical K steps it would never reach the target square of an oblique, and get stuck in an infinite loop. Originally n was only defined for non-oblique atoms.

This is not so easy to fix. The easiest solution is to expand the multipath move yoursef, expressing everything as K steps. That would make it a 6-leg move: 2 legs for the multi-path to the final destination, 2 legs to the locust square (transparently glued together with mp mode), and 2 legs back to the destination.  Like

afsafmpafzcabmpafzK