-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlab1.tar
More file actions
395 lines (335 loc) · 20 KB
/
Copy pathlab1.tar
File metadata and controls
395 lines (335 loc) · 20 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
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
toe.cpp 0000600 0065137 0016273 00000015264 14306037437 012135 0 ustar lsmit248 lsmit248 /*
Laura Smith 9/7/2022 2:13 AM toe.cpp 223 lines
Lab 1 CS202 Tic-Tac-Toe Part 1
For this lab I needed to create two parts, this is part one which is the interactive part of this
assignment. My code needed to be able to create an array the size of the user's choosing and then
initiate the array values to be blank. Then it needed to prompt the user to take turns filling in
the board and determine whether a win or tie has occured after every turn. In this lab I utilized
cin/cout, if loops, for loops, while loops, nested loops, and arrays.
*/
#include <iostream>
using namespace std;
int main() {
//initializing variables
char player = ' ';
int turn = 1;
int col = 0;
int row = 0;
int size = 0;
//Getting size from the user
cout << "Input Board Size:" << endl;
cin >> size;
//check for valid size
if (size < 2){
cout << "Invalid try again" << endl;
cout << "Input Board Size:" << endl;
cin >> size;
}
char board[size][size]; //board array
//for loop to initialize the game board of inputed size
for(int i = 0; i < size; i++){
for (int j = 0; j < size; j++){
board[i][j] = '-';
}
}
//while there is a space left and no wins have occured this loop goes
while (turn <= (size*size)){
//for even turn numbers it's X's turn, for odd it's O's turn
if (turn % 2 == 0)
player = 'X';
else
player = 'O';
//print board again to update player on available moves
for(int i = 0; i < size; i++){
cout << endl;
for (int j = 0; j < size; j++){
cout << board[i][j];
}
}
cout << endl;
//USER INTERACTIONS
//get the move from the player
cout << endl << "Player " << player << " Enter Row: " << endl;
cin >> row;
//check for valid row
while (row < 0 || row >= size){
cout << '\n' << "Invalid Enter Again:" << endl;
cin >> row;
if (row > 0 && row < size){
break;
}
}
cout << '\n' << "Player " << player << " Enter Column: " << endl;
cin >> col;
//check for valid col
while (col < 0 || col > size){
cout << '\n' << "Invalid Enter Again:" << endl;
cin >> col;
if (col > 0 && col < size){
break;
}
}
//check to see if it's an open spot
while (board[row][col] != '-'){
cout << '\n' << "Invalid Try Again" << endl;
//If not, ask for another entry
cout << "Enter Row: " << endl;
cin >> row;
//check for valid row
while (row < 0 || row >= size){
cout << '\n' << "Invalid Enter Again:" << endl;
cin >> row;
if (row > 0 && row < size){
break;
}
}
cout << '\n' << "Enter Column: " << endl;
cin >> col;
//check for valid col
while (col < 0 || col > size){
cout << '\n' << "Invalid Enter Again:" << endl;
cin >> col;
if (col > 0 && col < size){
break;
}
}
if (board[row][col] == '-')
break;
}
//put move onto board
board[row][col] = player;
//CHECK FOR WIN
//horizontal win check
for (row = 0; row <= size; row++){
for (col = 0; col <= size; col++){
if (board[row][col] != player){
break;
}
else if (col == (size-1)){
for(int i = 0; i < size; i++){
cout << endl;
for (int j = 0; j < size; j++){
cout << board[i][j];
}
}
cout << endl;
cout << '\n' << player << " wins!" << endl;
return 0;
}
}
}
//vertical win check
for (col = 0; col <= size; col++){
for (row = 0; row <= size; row++){
if (board[row][col] != player){
break;
}
else if (row == (size-1)){
for(int i = 0; i < size; i++){
cout << endl;
for (int j = 0; j < size; j++){
cout << board[i][j];
}
}
cout << endl;
cout << '\n' << player << " wins!" << endl;
return 0;
}
}
}
//Left diagonal win check
row= 0;
for (col = 0; col <= size; col++){
if (board[row][col] != player){
break;
}
else if (col == (size-1) && row == (size-1)){
for(int i = 0; i < size; i++){
cout << endl;
for (int j = 0; j < size; j++){
cout << board[i][j];
}
}
cout << endl;
cout << '\n' << player << " wins!" << endl;
return 0;
}
row = row + 1;
}
//Right diagonal win check
row = 0;
for (col = size-1; col <= size; col--){
if (board[row][col] != player){
break;
}
else if (col == 0 && row == size-1){
for(int i = 0; i < size; i++){
cout << endl;
for (int j = 0; j < size; j++){
cout << board[i][j];
}
}
cout << endl;
cout << '\n' << player << " wins!" << endl;
return 0;
}
row = row + 1;
}
//add turn to turn counter
turn ++;
}
//print board again in the case of a tie then announce the tie
for(int i = 0; i < size; i++){
cout << endl;
for (int j = 0; j < size; j++){
cout << board[i][j];
}
}
cout << endl;
cout << '\n' << "Tie!" << endl;
return 0;
} toecheck.cpp 0000600 0065137 0016273 00000012300 14306036647 013121 0 ustar lsmit248 lsmit248 /*
Laura Smith 9/7/2022 2:13 AM toecheck.cpp 169 lines
Lab 1 CS202 Tic-Tac-Toe Part 2
For this lab I needed to create two parts, this is part two which takes in an array of any size
which is a completed game. I needed my code to first read in this array and then asses whether a
win by X or O occured or a tie. In this part of the lab I utilized cin/cout, if loops, for loops,
while loops, nested loops, and arrays.
*/
#include <iostream>
using namespace std;
int main (){
//initialize values
int size = 0;
int row = 0;
int col = 0;
char val = ' ';
//create the board using the input file's specified size
cin >> size;
char board [size][size];
//put values in the board with a for loop
for(int i = 0; i < size; i++){
for (int j = 0; j < size; j++){
cin >> val;
board[i][j] = val;
}
}
//WIN CHECKS
//horizontal 'O' win check
/*
Checks each row looking for 'O' if it runs into anything but an O it goes onto the next
row until the end of the board. If it doesn't get broken out and it's at the end of the
row then it's a win for 'O'
*/
for (row = 0; row <= size; row++){
for (col = 0; col <= size; col++){
if (board[row][col] != 'O'){
break;
}
else if (col == (size-1)){
cout << "O wins" << endl;
return 0;
}
}
}
//horizontal 'X' win check
//works same as horizontal 'O' check but checks for X's
for (row = 0; row <= size; row++){
for (col = 0; col <= size; col++){
if (board[row][col] != 'X'){
break;
}
else if (col == (size-1)){
cout << "X wins" << endl;
return 0;
}
}
}
//vertical 'O' win check
//works same as horizontal 'O' check but checks the columns instead of the rows
for (col = 0; col <= size; col++){
for (row = 0; row <= size; row++){
if (board[row][col] != 'O'){
break;
}
else if (row == (size-1)){
cout << "O wins" << endl;
return 0;
}
}
}
//vertical 'X' win check
//works the same as vertical 'O' check but checks for 'X'
for (col = 0; col <= size; col++){
for (row = 0; row <= size; row++){
if (board[row][col] != 'X'){
break;
}
else if (row == (size-1)){
cout << "X wins" << endl;
return 0;
}
}
}
//Left diagonal 'O' win check
/*
starts in the top left and adds to the row and column each time to check along the main
diagonal for 'O'. If it runs into anything that isn't an 'O' it goes to next check as
there is only one diagonal running this way.
*/
row= 0;
for (col = 0; col <= size; col++){
if (board[row][col] != 'O')
break;
else if (col == (size-1) && row == (size-1)){
cout << "O wins" << endl;
return 0;
}
row = row + 1;
}
//Left diagonal 'X' win check
//works same as left diagonal 'O' win check but looks for 'X' instead
row= 0;
for (col = 0; col <= size; col++){
if (board[row][col] != 'X')
break;
else if (col == (size-1) && row == (size-1)){
cout << "X wins" << endl;
return 0;
}
row = row + 1;
}
//Right diagonal 'O' win check
/*
Starts in top right of grid and works it's way down to the bottom left by adding to the row
and subtracting from the column each time. If it detects anything but an 'O' it goes to next
win check since there is only one diagonal running this way.
*/
row = 0;
for (col = size-1; col <= size; col--){
if (board[row][col] != 'O'){
break;
}
else if (col == 0 && row == size-1){
cout << "O wins" << endl;
return 0;
}
row = row + 1;
}
//Right diagonal 'X' win check
//works same as right diagonal 'O' win check but checks for 'X' instead
row = 0;
for (col = size-1; col <= size; col--){
if (board[row][col] != 'X'){
break;
}
else if (col == 0 && row == size-1){
cout << "X wins" << endl;
return 0;
}
row = row + 1;
}
//If it's none of the win conditions then it has to be a tie
cout << "Tie" << endl;
return 0;
}