Could you get similar results with the following procedure: 1. Represent the world as a grid graph where each cell has a bidirectional edge to its orthogonal n

Could you get similar results with the following procedure: 1. Represent the world as a grid graph where each cell has a bidirectional edge to its orthogonal neighbors. 2. Randomly weight the edges. The distribution of these weights will affect the texture of the results and is a tunable parameter. 3. Compute a minimum spanning tree of the graph. 4. Fill in dead-ends ends of the minimum spanning tree unless the dead end contains a goal endpoint (in other words, prune branches of the minimum spanning tree that do not end in an endpoint).