This algorithm:
1. Add n-level dependencies control. How? I don't know
2. Check for boxes depending on movement from never-reachable areas.

Other algorithm - endpoints:
We don't treat box moves as moves to next cell, but to moves until an endpoint.
This way, huge maps with many free space will be solved much faster.