- Maze generation:
Wilson : uniform spanning tree, D ~ n^(1/2).
Recursive DFS : longer paths, D ~ n^(5/8).
Comb : difficult for CTE.

- Algorithms:
Random DFS independent DFSss with random tie-breaking. No-communication.
CTE [FGKP06]'s greedy algorithm. Agents go to nearest unfinished subtree. Distributed communications.
Potential algo [CM24] TODO. Full communication.
OPT 2-approximation of offline algorithm. Full knowledge.

- Suggested parameters:
Try with large number of robots an high speeds to see nice patterns emerge.