is it possible to take a pre built tree and convert it to a maze

[gary-programing]

basically i'm wondering if it would be possible to take a pre built tree with a set number of nodes and convert it to a maze of a certain size using code. i can do it using paper i'm just unsure how i would start to program this

[john-science]

That's a fun idea.

Mazelib certainly doesn't support that workflow out of the box. Nearly every maze-generating algorithm IS based on graph theory, so I bet it's not far off. But it's not supported Yet.

One major difference between the mazes modeled in Mazelib and what you have there is that where you have point 1 connected to point 2 and point 10, Mazelib would have 1 connected to 10 and that little empty square to the Left of 2. And THAT square would only lead down to 2. Does that make sense? The main difference in how Mazelib represents a maze is that in Mazelib every position in the maze is part of the graph, where in your graph on the right, the only positions that are graphed are positions where choices are made.

I'm not saying that your way is good or bad, it's just different enough it might be hard to model in Mazelib, is all.

[john-science]

Well, if it's for a project, I probably shouldn't help too much.

But do you about the Monte Carlo Method? It is a computational tool used most often in scientific disciplines.

And there is a Monte-Carlo tool built into Mazelib that you could use:

https://github.com/john-science/mazelib/blob/main/docs/API.md#advanced-controlling-maze-difficulty

[gary-programing]

cheers i appriciate any help that i can get

[gary-programing]

so say for example i generate 100 mazes like you have if i implement a similar method to the difficulty for your mazes but bassically analysising the number of choices in a maze or nodes with more than 1 potential path using the monte carlo method i should be able to pick out the most complex one correct?

[john-science]

Sure.

You would just need to m.solve() each maze. And then look at each solution and find some way to count the number of turns in each solution, to get back to your definition of complexity.

[gary-programing]

cheers this really helped