Revision as of 21:08, 16 December 2011 (view source) Sonia (talk \| contribs) (Go solution) ← Older edit		Revision as of 00:06, 17 December 2011 (view source) 79.50.194.219 (talk) (Updated D code) Newer edit →
Line 817: alias Tuple!(uint,"x", uint,"y") P; void visit(in int x, in int y) { seen[x][y] = true; P[] D = [P(x-1,y), P(x+1,y), P(x,y-1), P(x,y+1)]; P[] ns = array(filter!((p){ return p.x < W && p.y < H; })(D)); while (ns.length) { Pimmutable n = ns[uniform(0, ~~ns.length~~$)]; if (!seen[n.x][n.y]) { if (x != n.x) ? hWalls[min(x, n.x)][y] ~~= true;~~: ~~else~~ vWalls[x][min(y, n.y)]) = true; visit(n.tupleof); }

Maze generation: Difference between revisions

Maze generation (view source)