-
As Mathew Hertz I would like to run some additional algorithms (other then bfs and dfs) so I can see the effect of many other types of algorithms on my mazes
-
-
In order to allow for any types of mazes, the most flexible operation would be to have `GraphMaze` be the base structure (based on Boost.Graph), with vertices and edges indicating adjacency / neighbou…
-
### 🐛 Describe the bug
For generate on llama3.1, I got 9.1 tok/s, but chat is much slower. I got around 1.4 tok/s.
Test laptop: MacBook Pro with M1 Max, 64 GB memory. Sonoma 14.5
Details for bot…
-
there are quite a few algorithms to generate mazes. the wikipedia page is a quite nice starting point [wiki maze generation](https://en.wikipedia.org/wiki/Maze_generation_algorithm).
we should thin…
-
This deals with issue #23.
After the cellular automata algorithms have run, seldom do they generate usable mazes.
What we should do is determine connected components (using disjoint sets?), and …
-
How can we improve routing functions?
- [ ] support global router
- [ ] support auto-routing with arbitrary directions, at the moment groups of routes need to have the same angle.
See `gdsfac…
-
As Mathew Hertz I would like to keep track of the best run time among the algorithms i've run on this particular maze to determine which is the most efficient.
-
I am not sure if this is a smell or not, but I know it's what I ended up doing for a lot of the maze algorithms, as I had finished the code for them them before posting issues.
-
It would be wonderful to support all sorts of maze generation algorithms such as
- Depth First Search
- Kruskal's Algorithm
- Wilson's Algorithm
- Eller's Algorithm
- Prim's Algorithm