30:T4e5,function generate(cellWidth, cellHeight) { const heap = new Queue(); const cells = new Uint8Array(cellWidth * cellHeight); 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 % cellWidth, x1; let y0 = i0 / cellWidth | 0, y1; if (d0 === N) i1 = i0 - cellWidth, x1 = x0, y1 = y0 - 1, d1 = S; else if (d0 === S) i1 = i0 + cellWidth, 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 - cellWidth] === 0) { heap.push({index: i1, direction: N}, Math.random()); } if (y1 < cellHeight - 1 && cells[i1 + cellWidth] === 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 < cellWidth - 1 && cells[i1 + 1] === 0) { heap.push({index: i1, direction: E}, Math.random()); } } } return cells; }31:[] 2e:{"title":"Best-First Search","cells":[{"id":0,"value":"md`# Best-First Search\n\nMore specifically, [A* search](https://en.wikipedia.org/wiki/A*_search_algorithm).`","pinned":false,"hidden":false,"mode":"ojs"},{"id":122,"value":"viewof replay = html`