| 61 | |
| 62 | /* NxN board - prioritizes code reuse */ |
| 63 | public static Piece hasWon2(Piece[][] board) { |
| 64 | int N = board.length; |
| 65 | Piece winner = Piece.Empty; |
| 66 | |
| 67 | // Check rows and columns |
| 68 | for (int i = 0; i < N; i++) { |
| 69 | winner = getWinner(board, i, Check.Row); |
| 70 | if (winner != Piece.Empty) { |
| 71 | return winner; |
| 72 | } |
| 73 | |
| 74 | winner = getWinner(board, i, Check.Column); |
| 75 | if (winner != Piece.Empty) { |
| 76 | return winner; |
| 77 | } |
| 78 | } |
| 79 | |
| 80 | winner = getWinner(board, -1, Check.Diagonal); |
| 81 | if (winner != Piece.Empty) { |
| 82 | return winner; |
| 83 | } |
| 84 | |
| 85 | // Check diagonal |
| 86 | winner = getWinner(board, -1, Check.ReverseDiagonal); |
| 87 | if (winner != Piece.Empty) { |
| 88 | return winner; |
| 89 | } |
| 90 | |
| 91 | return Piece.Empty; |
| 92 | } |
| 93 | |
| 94 | /* NxN solution */ |
| 95 | public static Piece hasWon3(Piece[][] board) { |