I and J are somewhat different I think but they ar...

# random

[dalexander]

I and J are somewhat different I think but they are both going to rely on the same kind of pathfinding-on-a-plane. I’d probably solve J by being able to generate a list of visitable squares, while I is tricky because the load can’t move into the loader’s space so you need enough logic to loop to get out of a tight area. I haven’t solved this kind of problem in a while though so I might not be thinking of the best way to solve these things.