-
Notifications
You must be signed in to change notification settings - Fork 0
/
bomberman.js
52 lines (46 loc) · 1.71 KB
/
bomberman.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
var bomb = require('../lib/bomberman');
var should = require('should');
/**
* A field of N x M squares is represented by N lines of exactly M characters each. The character ‘*’ represents a mine and the character ‘.’ represents no-mine.
*
* Example input (a 3 x 4 mine-field of 12 squares, 2 of
* which are mines)
* 3 4 *... ..*. ....
* Your task is to write a program to accept this input and produce as output a hint-field of identical dimensions where each square is a * for a mine or the number of adjacent mine-squares if the square does not contain a mine.
*
* Example output (for the above input)
*
* *211 12*1 0111
*/
describe('Bomber', function () {
'use strict';
var data = {
'input': '3 4\n*...\n..*.\n....',
'dimensions': [3, 4],
'bombs': [
[1, 0, 0, 0],
[0, 0, 1, 0],
[0, 0, 0, 0]
],
'hint' : [
['*', 2, 1, 1],
[1, 2, '*', 1],
[0, 1, 1, 1],
],
'output' : '*211\n12*1\n0111'
};
it('locates bombs ', function () {
bomb.getBombs(data.input).should.be.eql(data.bombs);
});
it('returns hints data ', function () {
bomb.getHint(data.input).should.be.eql(data.hint);
});
it('counts neighbour suicide bombers', function () {
bomb.countNeighbourBombers([[1, 0, 0], [1, 0, 0], [1, 0, 0]], 1, 1).should.be.equal(3);
bomb.countNeighbourBombers([[1, 0, 0], [1, 0, 0], [1, 0, 0]], 2, 2).should.be.equal(0);
bomb.countNeighbourBombers([[1, 0, 0], [1, 0, 0], [1, 0, 0]], 0, 0).should.be.equal(1);
});
it('returns string output', function () {
bomb.parse(data.input).should.be.eql(data.output);
});
});