-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathVictory.java
115 lines (101 loc) · 3.78 KB
/
Victory.java
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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
public class Victory {
public Victory(){}
/**
* nos permitirá saber si hay 4 fichas de manera vertical
* @param board - recibira el tablero
* @param color - recibira el color de la ficha
* @return - nos devolvera el total de fichas consecutivas
*/
public int countVertical(char[][] board, char color){ //vertical
int countToken = 0;
int maxToken=0;
for (int j = 0; j <= Board.nColumn - 1; j++) {
for (int i = 0; i <= Board.nRow - 1; i++) {
if (board[i][j] == color)
countToken++;
else
countToken = 0;
if(countToken>maxToken)
maxToken=countToken;
}
}
return maxToken;
}
/**
* nos permitira saber si hay 4 fichas de manera horizontal consecutivas
* @param board - recibirá el tablero
* @param color - recibira el valor de la ficha
* @return - nos dira el total de fichas
*/
public int countHorizontal(char[][] board, char color){ //columnas
int countToken = 0;
int maxToken=0;
for (int i = 0; i <= Board.nRow - 1 ; i++){
for (int j = 0; j <= Board.nColumn - 1; j++) {
if (color == board[i][j])
countToken++;
else
countToken = 0;
if(countToken>maxToken)
maxToken=countToken;
}
}
return maxToken;
}
/**
* nos permitirá saber si hay 4 fichas de diagonal, tanto superior como inferior
* @param board - recibirá el tablero
* @param color - recibirá el valor de la ficha
* @return - nos dirá el total de fichas
*/
public int countDiagonal(char[][] board, char color){
int countTokenWinner = 0;
for (int i = 3; i < Board.nColumn - 1; i++){
for (int j = 0; j < Board.nRow - 3; j++){
if (board[i][j] == color
&& board[i - 1][j + 1] == color
&& board[i - 2][j + 2] == color
&& board[i - 3][j + 3] == color) {
countTokenWinner = 4;
}
}
}
// descendingDiagonalCheck
for (int i = 3; i < Board.nColumn - 1; i++){
for (int j = 3; j < Board.nRow - 1; j++){
if (board[i][j] == color
&& board[i - 1][j - 1] == color
&& board[i - 2][j - 2] == color
&& board[i - 3][j - 3] == color) {
countTokenWinner = 4;
}
}
}
return countTokenWinner;
}
/**
* nos permitirá saber que jugador ha ganado , en cuyo caso lo mostrara por pantalla
* @param board
* @param color
* @param turn
* @return - nos devolvera true para terminar la partida o false para seguir jugando
*/
public boolean isWinner(Board board, Color color, Turn turn){
assert !color.isNull();
if (countVertical(board.getBoard(), turn.getColorToken(color)) >= Board.TOKEN_WINNER
||countHorizontal(board.getBoard(), turn.getColorToken(color)) >= Board.TOKEN_WINNER
|| countDiagonal(board.getBoard(), turn.getColorToken(color)) >= Board.TOKEN_WINNER){
if (color == Color.R) {
board.showInterface();
Message.PLAYER_WIN.writeln("RED");
}
else if (color == Color.Y) {
board.showInterface();
Message.PLAYER_WIN.writeln("YELLOW");
}
return true;
}
return false;
}
//
}