2d:null 2e:["$","title",null,{"children":"Mazes | bchoatejr | Observable"}] 33:T7d9,// from [@emerycarr/manhattan-particles](https://observablehq.com/@emerycarr/manhattan-particles) viewof fm = { let makeDict = (pairs) => Object.assign({}, ...Array.from(pairs, ([key, val]) => ({[key]: val}) )); const params = (keys, vals) => makeDict(keys.map((key, i) => [key, vals[i]])); const opt = { slider: (vals) => slider(params(['title','min','max','step','value'], vals)), color: (vals) => color(params(['title','value'], vals)), }; const options = { // title min max step default width: opt.slider( ["width", 4, width, 1, width ]), height: opt.slider( ["height", 4, width, 1, width]), // broke cellSize: opt.slider( ["cellSize", 2, width, 1, 10 ]), // 2, 61: kind of cool cellSpacing: opt.slider( ["cellSpacing", 2, width, 1, 10]), lineWidth: opt.slider( ["lineWidth", 0, 25, 1, 0]), bgColor: opt.color( ["background", "#000000"]), stroke: opt.color( ["stroke", "#00ffff"]), fill: opt.color( ["fill", "#00ffff"]), }; const element = html`

${values(options)}

`; element.oninput = function() { const result = {}; for (var x in options) { result[x] = options[x].value } element.value = result; } element.oninput(); return element; function values(dict) { const result = []; for (var x in dict) { result.push(dict[x]); }; return result; } }34:T4a6,function generate(cols, rows) { const heap = new Queue(); const cells = new Uint8Array(cols * rows); let edge; heap.push({index: 0, direction: N}, Math.random()); heap.push({index: 0, direction: E}, Math.random()); while (edge = heap.pop()) { let i0 = edge.index, i1; let d0 = edge.direction, d1; let x0 = i0 % cols, x1; let y0 = i0 / cols | 0, y1; if (d0 === N) i1 = i0 - cols, x1 = x0, y1 = y0 - 1, d1 = S; else if (d0 === S) i1 = i0 + cols, x1 = x0, y1 = y0 + 1, d1 = N; else if (d0 === W) i1 = i0 - 1, x1 = x0 - 1, y1 = y0, d1 = E; else i1 = i0 + 1, x1 = x0 + 1, y1 = y0, d1 = W; if (cells[i1] === 0) { cells[i0] |= d0, cells[i1] |= d1; if (y1 > 0 && cells[i1 - cols] === 0) { heap.push({index: i1, direction: N}, Math.random()); } if (y1 < rows - 1 && cells[i1 + cols] === 0) { heap.push({index: i1, direction: S}, Math.random()); } if (x1 > 0 && cells[i1 - 1] === 0) { heap.push({index: i1, direction: W}, Math.random()); } if (x1 < cols - 1 && cells[i1 + 1] === 0) { heap.push({index: i1, direction: E}, Math.random()); } } } return cells; }35:T6b3,md`## References - [@mbostock/prims-algorithm-flood](https://observablehq.com/@mbostock/prims-algorithm-flood) - [wiki/Maze](https://en.wikipedia.org/wiki/Maze) - [SE How Many mazes](https://math.stackexchange.com/questions/2679666/how-many-valid-mazes-of-some-size-are-there) - [wiki/Prim's_algorithm](https://en.wikipedia.org/wiki/Prim%27s_algorithm) - [classify](http://www.math.stonybrook.edu/~tony/mazes/classify.html) - [bl.ocks d3.each](https://bl.ocks.org/mbostock/4c5fad723c87d2fd8273) - [SO](https://stackoverflow.com/questions/14218016/each-with-a-filter) - [@jrus/roses](https://observablehq.com/@jrus/roses) multiplot - [jamisbuck](http://weblog.jamisbuck.org/2011/1/27/maze-generation-growing-tree-algorithm) :: [book](https://www.amazon.com/Mazes-Programmers-Twisty-Little-Passages/dp/1680500554) ### Other Maze Notebooks - [@andreaskdk/kruskals-algorithm-for-maze-generation](https://observablehq.com/@andreaskdk/kruskals-algorithm-for-maze-generation) :: [circular](https://observablehq.com/@andreaskdk/kruskals-algorithm-for-circular-maze) - [@jaywunder/maze-generator](https://observablehq.com/@jaywunder/maze-generator) - [@cadeo111/depth-first-maze-generator-algorithm](https://observablehq.com/@cadeo111/depth-first-maze-generator-algorithm) - [@matharumanpreet00](https://observablehq.com/@matharumanpreet00/maze-generation-with-randomized-dfs) - [@markmeyerphoto/mst-maze](https://observablehq.com/@markmeyerphoto/mst-maze) nodes and links - [@tbd/maze-generator-2](https://observablehq.com/@tbd/maze-generator-2) maze grid :: [@tbd/maze-generator](https://observablehq.com/@tbd/maze-generator) - [@jgrunik/growing-tree-algorithm](https://observablehq.com/@jgrunik/growing-tree-algorithm) `36:[] 31:{"id":"b192deb2679390de","slug":"mazes","title":"Mazes","thumbnail":"840ab10c7194d81cc4827b0ec47e0450ef12b28ef28f2a9a87400d3d2d0e486c","access_level":"public","create_time":"$D2019-05-29T17:27:09.230Z","update_time":"$D2019-06-24T05:33:09.481Z","view_time":null,"first_public_time":"$D2019-05-31T17:12:52.929Z","has_unpublished_edits":null,"fork":{"id":"b9dceb66104c9915","slug":"prims-algorithm-flood","title":"Prim’s Algorithm Flood","owner":{"id":"8c2e47252fd4995c","login":"mbostock","name":"Mike Bostock"}},"stars":2,"starred":false,"owner":{"type":"team","id":"727607e20e3c61f9","login":"bchoatejr","name":"","avatar_url":"https://avatars-next.observableusercontent.com/4881a705d0248e8076cbb21f9672c3d34d1e29310ae73f42e63f26691173b539","tier":"starter_2024"},"version":580,"publish_version":580,"role":null,"authored":false,"authors":[{"type":"individual","id":"43e14e124e3e99b4","login":"bchoatejr","name":"","avatar_url":"https://avatars-next.observableusercontent.com/4881a705d0248e8076cbb21f9672c3d34d1e29310ae73f42e63f26691173b539","tier":null}],"members":[{"type":"individual","id":"43e14e124e3e99b4","login":"bchoatejr","name":"","avatar_url":"https://avatars-next.observableusercontent.com/4881a705d0248e8076cbb21f9672c3d34d1e29310ae73f42e63f26691173b539","tier":null,"role":"editor"}],"comments":[],"custom_thumbnail":false,"trashed":false,"lapsed":null,"subscribed":null,"forks":9,"collection":{"id":"878169029976c49a","slug":"mazes","title":"mazes","owner":{"id":"727607e20e3c61f9","login":"bchoatejr","name":""}},"type":"notebook","body":{"title":"Mazes","cells":[{"id":0,"value":"md`# Mazes`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":125,"value":"viewof replay = html`