Maze generation: Difference between revisions

Updated D code
(Updated D code)
Line 744:
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 p){ return p.x<W && p.y<H; })(D));
while (ns.length) {
P n = ns[uniform(0, ns.length)];
Anonymous user