multi-agent pathfinding (MAPF) is the problem of finding a set of
conflict-free paths for a set of agents. Typically, the agents' moves are
limited to a pre-defined graph of possible locations and allowed transitions
between them, e.g. a 4-neighborhood grid. We explore how to solve MAP