let w;

let grid = [];

​

let current;

​

let stack = [];

​

function setup() {

  createCanvas(601, 601);

  //frameRate(5);

  w = 20;

  cols = floor(width / w);

  rows = floor(height / w);

​

  for (let j = 0; j < rows; j++) {

    for (let i = 0; i < cols; i++) {

      let cell = new Cell(i, j);

      grid.push(cell);

    }

  }

​

  current = grid[index(cols / 2, rows / 2)];

}

​

function draw() {

  background(0);

  for (let i = 0; i < grid.length; i++) {

    grid[i].show();

  }

  current.visited = true;

  current.highlight();

  //STEP 1

  let next = current.checkNeighbors();

  if (next) {

    next.visited = true;

​

    //STEP 2

    stack.push(current);

​

    //STEP 3

    removeWalls(current, next);

​

    //STEP 4

    current = next;

  } else if (stack.length > 0) {

    current = stack.pop();

  } else {

    console.log("Maze Complete!!! (Maze generation algorithm: Depth-First search (Recursive Backtracker)");

    noLoop();

  }

}

​

function removeWalls(a, b) {

  let x = a.i - b.i;

  //top, right, bottom, left

  if (x == 1) {

    a.walls[3] = false;

    b.walls[1] = false;

  } else if (x == -1) {

    a.walls[1] = false;

    b.walls[3] = false;

  }

​

  let y = a.j - b.j;

  if (y == 1) {

    a.walls[0] = false;

    b.walls[2] = false;

  } else if (y == -1) {

    a.walls[2] = false;

    b.walls[0] = false;

  }

}

​

function index(i, j) {

  if (i < 0 || j < 0 || i > cols - 1 || j > rows - 1) {

    return -1

  } else {

    return i + j * cols;

  }

}