Basically I did this http://jheusser.github.io/2013/02/03/satcoin.html but for motocoin's PoW instead of SHA collision.

The "problem" with this approach (which actually makes moto far more secure than btc against this kind of approach) is the very large breadth of multipliers involved in the moto calculations.

TL;DR Working a physics solution backwards as has been proposed earlier is not a viable approach to machine mining at this time and we can infer from this that it is unlikely that any alternative approach will beat contemporary general purpose AI algorithms like annealing per-challenge (which is what *all* of the winning bots seem to be using right now, lol) at least without very fancy specialized tricks of mathematics. (edit: or in other words we can say confidently for awhile that the moto work challenge itself is sufficiently hard for computers.  Harder than most any traditional hashing, by quite a bit.  "ASIC resistant" isn't even the name for it.)