A perfect maze cut by recursive backtracker, then braided with loops. The solver walks breadth-first and paints its search before the route.