-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathCode.c
More file actions
175 lines (151 loc) · 3.87 KB
/
Code.c
File metadata and controls
175 lines (151 loc) · 3.87 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
/C program to design a TIC TAC TOE game./
#include <stdio.h>
#include <stdlib.h>
/print matrix/
void printMatrix(char val);
/update value in matrix/
void insertValue(int i, int j, unsigned char user);
/check matrix is full or not/
unsigned char isFull(void);
/check game is completed or not./
unsigned char isOver(void);
unsigned char mat[3][3] = { '', '', '', '', '', '', '', '', '_' };
unsigned char usertern = 0;
unsigned char onlyOnce = 0;
int main()
{
unsigned char user1[30], user2[30], winner;
int ival, jval;
printf("\nEnter name of user1 :");
gets(user1);
fflush(stdin);
printf("Enter name of user2 :");
gets(user2);
fflush(stdin); #Modified By Kalpak Kanungo
again:
system("clear");
printf("\n\n\n\n");
if (!onlyOnce) {
printMatrix(0);
onlyOnce = 1;
}
else {
printMatrix(1);
}
winner = isOver();
if (winner) {
printf("\n * Congratulations Dear %s ,\n You have won the game . !!!!", ((winner == 'X') ? user1 : user2));
goto end;
}
if (!isFull()) {
printf("\n * Game Over .");
goto end;
}
repeat:
fflush(stdin);
printf("\n * %s , Enter value (00-22) seperated by space :", (usertern == 0x00 ? user1 : user2));
scanf("%d%d", &ival, &jval);
if ((ival > 2 || ival < 0) || (jval > 2 || jval < 0)) {
printf("\n * ERROR : Invalid index, try again !!!");
goto repeat;
}
if (mat[ival][jval] != '_') {
printf("\n * ERROR : Already filled,try again !!!");
goto repeat; #Modified by Kalpak Kanungo
}
insertValue(ival, jval, usertern);
usertern = !usertern;
goto again;
end:
printf("\n");
return 0;
}
void printMatrix(char val)
{
unsigned char i, j;
if (!val) {
/For blank matrix/
for (i = 0; i < 3; i++) {
printf("\t\t\t");
for (j = 0; j < 3; j++) {
printf("[%3c ] ", mat[i][j]); #Modified By Kalpak Kanungo
}
printf("\n");
}
return;
}
for (i = 0; i < 3; i++) {
printf("\t\t\t");
for (j = 0; j < 3; j++) {
printf("[%3c ] ", mat[i][j]);
}
printf("\n");
}
return;
}
void insertValue(int i, int j, unsigned char user)
{
// printf("\n ##### %d, %d ###\n",i,j);
mat[i][j] = ((user == 0x00) ? 'X' : 'O');
}
unsigned char isFull(void)
{
unsigned char i, j, count = 0;
;
for (i = 0; i < 3; i++)
for (j = 0; j < 3; j++) {
if (mat[i][j] == '_')
++count;
}
return count;
}
unsigned char isOver(void)
{
unsigned char i, j, user;
unsigned char storeChar = 0, flag;
int sum = 0;
// case 1
/sum of 'X'+'X'+'X' = 264 and sum of 'O'+'O'+'O' =237/
flag = 0;
for (i = 0; i < 3; i++) {
sum = 0;
for (j = 0; j < 3; j++) {
if (mat[i][j] == '_')
break;
sum += mat[i][j];
storeChar = mat[i][j];
}
if (sum == 237 || sum == 264) {
return storeChar; #Modified By Kalpak Kanungo
}
}
// case 2
for (i = 0; i < 3; i++) {
sum = 0;
for (j = 0; j < 3; j++) {
if (mat[j][i] == '_')
break;
sum += mat[j][i];
storeChar = mat[j][i];
}
if (sum == 237 || sum == 264) { #Modified By Kalpak Kanungo
return storeChar;
}
}
// case 3
for (i = 0; i < 3; i++) {
sum = 0;
for (j = 0; j < 3; j++) {
if (i == j) {
if (mat[i][j] == '_')
break;
sum += mat[i][j];
storeChar = mat[i][j];
}
}
if (sum == 237 || sum == 264) {
return storeChar; #Modified By Kalpak Kanungo
}
}
return 0;
}