Repository navigation
Expand file tree
/
Copy pathTic Tac Toe.cpp
More file actions
193 lines (172 loc) · 3.78 KB
/
Copy pathTic Tac Toe.cpp
File metadata and controls
193 lines (172 loc) · 3.78 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
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
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
#include<bits/stdc++.h>
using namespace std;
int grid[3][3];
int dx[] = {0,0,0,1,1,1,2,2,2};
int dy[] = {0,1,2,0,1,2,0,1,2};
void printGrid()
{
for(int i=0; i<3; i++)
{
cout<<"|";
for(int j=0; j<3; j++)
cout<<grid[i][j]<<"|";
cout<<endl;
}
cout<<endl;
}
bool fillGrid(int pos)
{
if(grid[dx[pos-1]][dy[pos-1]]==0)
{
grid[dx[pos-1]][dy[pos-1]] = 1;
return true;
}
return false;
}
bool rowMove(int x)
{
for(int i=0; i<3; i++)
{
if(grid[i][0]==0&&grid[i][1]==x&&grid[i][2]==x)
{
grid[i][0] = 2;
return true;
}
if(grid[i][0]==x&&grid[i][1]==0&&grid[i][2]==x)
{
grid[i][1] = 2;
return true;
}
if(grid[i][0]==x&&grid[i][1]==x&&grid[i][2]==0)
{
grid[i][2] = 2;
return true;
}
}
return false;
}
bool columnMove(int x)
{
for(int i=0; i<3; i++)
{
if(grid[0][i]==0&&grid[1][i]==x&&grid[2][i]==x)
{
grid[0][i] = 2;
return true;
}
if(grid[0][i]==x&&grid[1][i]==0&&grid[2][i]==x)
{
grid[1][i] = 2;
return true;
}
if(grid[0][i]==x&&grid[1][i]==x&&grid[2][i]==0)
{
grid[2][i] = 2;
return true;
}
}
return false;
}
bool diagonalMove(int x)
{
if(grid[0][0]==0&&grid[1][1]==x&&grid[2][2]==x)
{
grid[0][0] = 2;
return true;
}
if(grid[0][0]==x&&grid[1][1]==0&&grid[2][2]==x)
{
grid[1][1] = 2;
return true;
}
if(grid[0][0]==x&&grid[1][1]==x&&grid[2][2]==0)
{
grid[2][2] = 2;
return true;
}
if(grid[0][2]==0&&grid[1][1]==x&&grid[2][0]==x)
{
grid[0][2] = 2;
return true;
}
if(grid[0][2]==x&&grid[1][1]==0&&grid[2][0]==x)
{
grid[1][1] = 2;
return true;
}
if(grid[0][2]==x&&grid[1][1]==x&&grid[2][0]==0)
{
grid[2][0] = 2;
return true;
}
return false;
}
void oponentMove()
{
/// Offensive Move
if(rowMove(2)) return;
if(columnMove(2)) return;
if(diagonalMove(2)) return;
/// Defensive Move
if(rowMove(1)) return;
if(columnMove(1)) return;
if(diagonalMove(1)) return;
/// Random Pick
for(int i=0; i<3; i++)
for(int j=0; j<3; j++)
if(grid[i][j]==0)
{
grid[i][j] = 2;
return;
}
}
bool checkDraw()
{
for(int i=0; i<3; i++)
for(int j=0; j<3; j++)
if(!grid[i][j])
return false;
return true;
}
int checkWinner()
{
/// Row Cross
for(int i=0; i<3; i++)
if(grid[i][0]>0&&grid[i][0]==grid[i][1]&&grid[i][1]==grid[i][2])
return grid[i][0];
/// Column Cross
for(int i=0; i<3; i++)
if(grid[0][i]>0&&grid[0][i]==grid[1][i]&&grid[1][i]==grid[2][i])
return grid[0][i];
/// Diagonal Cross 1
if(grid[0][0]>0&&grid[0][0]==grid[1][1]&&grid[1][1]==grid[2][2])
return grid[0][0];
/// Diagonal Cross 2
if(grid[0][2]>0&&grid[0][2]==grid[1][1]&&grid[1][1]==grid[2][0])
return grid[0][0];
if(checkDraw()) return 3;
return -1;
}
int main()
{
cout<<"Welcome to Tic-Tac-Toe"<<endl<<endl;
int pos,win = -1;
while(win<0)
{
printGrid();
cout<<"Pick a spot"<<endl;
cin>>pos;
if(fillGrid(pos)) oponentMove();
else
cout<<"Invalid Move TRY Again!!!"<<endl;
win = checkWinner();
}
printGrid();
if(win==1)
cout<<"Whoo!!! YOU Win"<<endl;
else if(win==2)
cout<<"Sorry YOU Loose!!! :("<<endl;
else
cout<<"It's a Draw"<<endl;
return 0;
}