minesweeper

index.js

const assert = require('assert');
const _ = require('lodash');

class Masu {
  constructor(isMine, isOpened) {
    this.isMine = isMine;
    this.isOpened = isOpened;
  }
}

const Board = _.chunk(_.shuffle(_.times(10, () => new Masu(true, false)).concat(_.times(71, () => new Masu(false, false)))), 9)
console.log(Board)

function display(board) {
  console.log(board.map(b => b.map(t => t.isMine ? '*' : '-').join('')).join("\n"))
}

function countAdjacentMine(x, y, board) {
  let count = 0;
  for (let a = x-1; a <= x+1; a++)
    for (let b = y-1; b <= y+1; b++)
      if (board[a] && board[a][b] && board[a][b].isMine) count++;
  return count;
}

function display2(board) {
  console.log(
    board.map((b, x) => (
      b.map((t, y) => (
        !t.isOpened ? '-' :
        t.isMine ? '*' :
        (countAdjacentMine(x, y, board) || 'o')
      )).join('')
    )).join("\n")
  );
}

display(Board)
console.log('==============')

function open(x, y, board) {
  const masu = board[x][y];
  assert(!masu.isOpened)

  masu.isOpened = true;
  if (masu.isMine) {
    console.log('MINE')
    return false;
  }
  const count = countAdjacentMine(x, y, board);
  if (count > 0) {
    return true;
  }
  for (let a = x-1; a <= x+1; a++)
    for (let b = y-1; b <= y+1; b++)
      if (board[a] && board[a][b] && !board[a][b].isOpened) {
        open(a, b, board);
      }
  return true;
}

open(0, 0, Board)
display2(Board)