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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
|
#include <iostream>
using namespace std;
// tic-tac-toe
// произволна големина на полето.
// произволна дължина на линията.
// произволен брой играчи
const unsigned FIELD_SIZE = 3;
const unsigned LINE_SIZE = 3;
const unsigned PLAYERS_COUNT = 2;
void init(char field[FIELD_SIZE][FIELD_SIZE])
{
for (unsigned i = 0; i < FIELD_SIZE; i++)
{
for (unsigned j = 0; j < FIELD_SIZE; j++)
field[i][j] = ' ';
}
}
void print(const char field[FIELD_SIZE][FIELD_SIZE])
{
for (unsigned i = 0; i < FIELD_SIZE; i++)
{
for (unsigned j = 0; j < FIELD_SIZE; j++)
cout << " [" << field[i][j] <<"] ";
cout << endl;
}
}
bool areValidIndices(unsigned playerX, unsigned playerY)
{
return playerX >= 0 && playerX < FIELD_SIZE&& playerY >= 0 && playerY < FIELD_SIZE;
}
bool isCellFree(const char field[FIELD_SIZE][FIELD_SIZE], unsigned playerX, unsigned playerY)
{
//допускам, че вече сме минали проверката за валидност на индексите!
return field[playerX][playerY] == ' ';
}
void userInput(const char field[FIELD_SIZE][FIELD_SIZE], unsigned& playerX, unsigned& playerY)
{
cin >> playerX >> playerY;
while (!areValidIndices(playerX, playerY) || !isCellFree(field, playerX, playerY))
{
cout << "Error! Invalid input!" << endl;
cin >> playerX >> playerY;
}
}
bool containsКConsecutiveChars(const char* arr, unsigned size, char player)
{
if (size < LINE_SIZE)
return false;
//LINE_SIZE
int count = 0;
for (unsigned i = 0; i < size; i++)
{
if (arr[i] == player)
count++;
else
count = 0;
if (count == LINE_SIZE)
return true;
}
return false;
}
//cloud be modified: looking for a line including the last marked point.
//Now we are making useless checks of lines
bool isWinner(const char field[FIELD_SIZE][FIELD_SIZE], char player)
{
//rows
for (unsigned i = 0; i < FIELD_SIZE; i++)
{
if (containsКConsecutiveChars(field[i], FIELD_SIZE, player))
return true;
}
//cols
for (unsigned i = 0; i < FIELD_SIZE; i++)
{
char currentCol[FIELD_SIZE];
for (unsigned j = 0; j < FIELD_SIZE; j++)
currentCol[j] = field[i][j];
if (containsКConsecutiveChars(currentCol, FIELD_SIZE, player))
return true;
}
//diagonals
//(left -> right)
for (unsigned i = 0; i < FIELD_SIZE; i++)
{
char currentDiag1[FIELD_SIZE];
unsigned iter1 = 0;
char currentDiag2[FIELD_SIZE];
unsigned iter2 = 0;
for (unsigned row = i, col = 0; row < FIELD_SIZE; row++, col++)
{
currentDiag1[iter1++] = field[row][col];
currentDiag2[iter2++] = field[col][row];
}
if (containsКConsecutiveChars(currentDiag1, iter1, player)
|| containsКConsecutiveChars(currentDiag2, iter2, player))
return true;
}
//(right -> left) (part 1)
for (unsigned i = 0; i < FIELD_SIZE; i++)
{
char currentDiag[FIELD_SIZE];
unsigned iter = 0;
for (unsigned row = i, col = FIELD_SIZE - 1; row < FIELD_SIZE; row++, col--)
currentDiag[iter++] = field[row][col];
if (containsКConsecutiveChars(currentDiag, iter, player))
return true;
}
//(right -> left) (part 2)
for (unsigned i = 0; i < FIELD_SIZE; i++)
{
char currentDiag[FIELD_SIZE];
unsigned iter = 0;
for (int row = 0, col = i; col >= 0; row++, col--)
currentDiag[iter++] = field[row][col];
if (containsКConsecutiveChars(currentDiag, iter, player))
return true;
}
return false;
}
int main()
{
char field[FIELD_SIZE][FIELD_SIZE];
init(field);
bool hasWinner = false;
print(field);
while (!hasWinner)
{
for (char player = '1'; player < '1' + PLAYERS_COUNT; player++)
{
unsigned playerX, playerY;
userInput(field, playerX, playerY);
field[playerX][playerY] = player;
system("CLS");
print(field);
if (isWinner(field, player))
{
cout << "Congrats! Winner: " << player << endl;
hasWinner = true;
break;
}
}
}
}
|
