Let's give this a try for some of the global functions.

• choose directions randomly and prefer same direction (make this tuneable to make passages more or less windy)
• reevaluate tiles once they are popped off the stack to ensure we don't dig invalid tiles

Ensure correctness. Possibly assert.

Just like Nic's ssh config gist

I've learned a lot about js since I wrote this.

It's really slow right now because it flood fills every time a connector is added. Let's use smarter data structures.

unconnected, between rooms

of rooms

windiness of passage
interconnectedness
size of rooms

Hopefully javascript can be executed in gh-pages, it's static content after all.

This is for visual clarification, colours can repeat if there are many regions.

Make this easily adjustable for tuning the dungeon.

comments
readme

Regardless of topology, floodfill should cover all leftover space after placing rooms. This will mean running the algorithm multiple times with different colours.

Make an MST with a random chance to open redundant doors to make an imperfect dungeon.

For demonstration purposes, animate a flood fill of the end result of connecting all the nodes of the dungeon.

Maybe wrap everything in a function.

comment on sources and references and outline algorithm
'implementation of <bob nystrom's> algorithm'