forked from KonradSchieban/tetris
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtesting.js
More file actions
60 lines (50 loc) · 1.37 KB
/
Copy pathtesting.js
File metadata and controls
60 lines (50 loc) · 1.37 KB
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
53
54
55
56
57
var board = [[-1,-1,-1,-1,-1],
[-1,-1,-1,-1,-1],
[2,2,1,1,-1],
[-1,-1,-1,-1,-1],
[-1,-1,-1,1,-1],
[2,2,1,1,1],
[1,2,1,1,1],
[1,2,3,-1,-1]];
console.log(board);
isRowFull = function(rowIndex){
let row = board[rowIndex];
let rowFull = true;
for(let i = 0; i < row.length; i++){
if(row[i] === -1){
rowFull = false;
break;
}
}
return rowFull;
},
getFullRows = function(board){
let numberOfRows = board.length;
let fullRowArray = [];
for(let i = 0; i < numberOfRows; i++){
if(this.isRowFull(i)){
fullRowArray.push(i);
}
}
return fullRowArray;
},
dropFullRows = function(fullRowArray, board){
// Delete full rows
for(let j = 0; j < fullRowArray.length; j++){
let rowIndex = fullRowArray[j];
for(let k = rowIndex; k > 0; k--){
//let row = JSON.parse(JSON.stringify(board[k]));
//let rowAbove = JSON.parse(JSON.stringify(board[k-1]));
let row = board[k];
let rowAbove = board[k-1];
for(let i = 0; i < row.length; i++){
row[i] = rowAbove[i];
}
board[k] = row;
}
}
}
var fullRowArray = getFullRows(board);
if(fullRowArray.length > 0){
dropFullRows(fullRowArray, board);
}