OragonEfreet/banjo
OragonEfreet/banjo
1
0
Fork 0
Code Issues 16 Pull requests Projects 1 Releases 6 Activity Actions

Aldous-Broder algorithm #164

New issue
Closed
opened 2026-07-30 20:49:52 +02:00 by OragonEfreet · 0 comments
OragonEfreet commented 2026-07-30 20:49:52 +02:00
Owner
Copy link

A random walk that draws every maze a grid admits as often as every other, at the cost of speed. Names no direction, so it works on any family.

A random walk that draws every maze a grid admits as often as every other, at the cost of speed. Names no direction, so it works on any family.
OragonEfreet added this to the 1.1 milestone 2026-07-30 20:49:52 +02:00
Sign in to join this conversation.
No Branch/Tag specified
Branches Tags
main
release/1.0
pizza
v1.0.0
v1.0.0-rc.3
v1.0.0-rc.2
v1.0.0-rc.1
v1.0.0-alpha.1
v1.0.0-alpha
Labels
Clear labels   
bug
Something is not working

  
duplicate
This issue or pull request already exists

  
enhancement
New feature

  
help wanted
Need some help

  
invalid
Something is wrong

  
question
More information is needed

  
wontfix
This won't be fixed

No labels
bug
duplicate
enhancement
help wanted
invalid
question
wontfix
Milestone
Clear milestone
No items
No milestone
1.1
Projects
Clear projects
No items
No project
Assignees
Clear assignees
No assignees
OragonEfreet
1 participant
Notifications
Due date
The due date is invalid or out of range. Please use the format "yyyy-mm-dd".

No due date set.

Dependencies

No dependencies set.

Reference
OragonEfreet/banjo#164
No description provided.