Repository navigation
Expand file tree
/
Copy pathtry.cpp
More file actions
126 lines (118 loc) · 3.38 KB
/
Copy pathtry.cpp
File metadata and controls
126 lines (118 loc) · 3.38 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
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
116
117
118
119
120
121
122
123
124
125
126
#include <iostream>
#include <vector>
#include <thread>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <ctime>
#include <chrono>
#include <netinet/in.h>
#include <sys/socket.h>
#include <arpa/inet.h>
#include <unistd.h>
using namespace std;
class GameBoard {
public:
GameBoard();
~GameBoard();
void printBoard();
bool makeMove(int column, int player_num);
int checkWin();
int board[6][7];
private:
const int ROWS = 6;
const int COLS = 7;
const int WIN_LEN = 4;
int countInDirection(int row, int col, int row_dir, int col_dir, int player_num);
};
GameBoard::GameBoard() {
memset(board, 0, sizeof(board));
}
GameBoard::~GameBoard() {}
void GameBoard::printBoard() {
for (int i = 0; i < ROWS; i++) {
for (int j = 0; j < COLS; j++) {
cout << board[i][j] << " ";
}
cout << endl;
}
cout << endl;
}
bool GameBoard::makeMove(int column, int player_num) {
if (column < 0 || column >= COLS) {
return false;
}
int row = ROWS-1;
while (board[row][column] != 0 && row >= 0) {
row--;
}
if (row >= 0) {
board[row][column] = player_num;
return true;
} else {
return false;
}
}
int GameBoard::checkWin() {
for (int i = 0; i < ROWS; i++) {
for (int j = 0; j < COLS; j++) {
if (board[i][j] != 0) {
int player_num = board[i][j];
// Check for horizontal win
if (j <= COLS-WIN_LEN) {
bool win = true;
for (int k = 1; k < WIN_LEN; k++) {
if (board[i][j+k] != player_num) {
win = false;
break;
}
}
if (win) {
return player_num;
}
}
// Check for vertical win
if (i <= ROWS-WIN_LEN) {
bool win = true;
for (int k = 1; k < WIN_LEN; k++) {
if (board[i+k][j] != player_num) {
win = false;
break;
}
}
if (win) {
return player_num;
}
}
// Check for diagonal win (down-right)
if (i <= ROWS-WIN_LEN && j <= COLS-WIN_LEN) {
bool win = true;
for (int k = 1; k < WIN_LEN; k++) {
if (board[i+k][j+k] != player_num) {
win = false;
break;
}
}
if (win) {
return player_num;
}
}
// Check for diagonal win (down-left)
if (i <= ROWS-WIN_LEN && j >= WIN_LEN-1) {
bool win = true;
for (int k = 1; k < WIN_LEN; k++) {
if (board[i+k][j-k] != player_num) {
win = false;
break;
}
}
if (win) {
return player_num;
}
}
}
}
}
return 0;
}