Tic-Tac-Toe Write a program that allows two players (player X and player O) to p
ID: 3641752 • Letter: T
Question
Tic-Tac-ToeWrite a program that allows two players (player X and player O) to play a game of tic-tac-toe. Use a two- dimensional char array with three rows and three columns as the game board. Each element of the array should be initialized with an asterisk (*). The players take turns making moves and the program keeps track of whose turn it is. Player X moves first. The program should run a loop that:
Displays the contents of the board array (see prompts and output, below).
Prompts and allows the player whose turn it is to select a location on the board for an X in the case of player X or an O in the case of player O. The program should ask the player to enter the row and column number. Valid row or column numbers are 1, 2, or 3.
The loop terminates when a player has won, or a tie has occurred. If a player has won, the program should declare that player the winner and end. If a tie has occurred, the program should say so and end.
Player X (O) wins when there are three Xs (three Os) in a row on the game board. The Xs (Os) can appear in a row, in a column, or diagonally across the board. A tie occurs when all of the locations on the board are full, but there is no winner.
Input Validation: The program should check the validity of the row and column numbers entered by the players. To be valid, the row and column number must refer to an unoccupied position in the game board. When an invalid entry is made, the program simply redisplays its most recent prompt and attempts to reread the value.
Prompts And Output Labels: The board is displayed as a sequence of three rows, each with three characters. The characters are "X" or "O" or "." depending on whether player X or player O has chosen that position or whether the position is still unselected. Thus the following:
. . X
O . X
. . .
represents the board when it's O's turn and when X has moved twice (to row1/column3 and row2/column3) and O has moved once (to row2/column1).
Players are prompted as "Player X, row and column:" or "Player O, row and column:". The game's end is announced either by "Player X wins", or "Player O wins" or "The cat wins" (in the case of no winner).
Explanation / Answer
#include <iostream>
using namespace std;
int main()
{
//LOCAL DECLARATIONS
char grid[3][3];
int freeSlots, row, col;
char player, response = 'y';
bool end, hasWinner;
while (toupper(response) == 'Y')
{
for (int r = 0; r < 3; r++) //init
for (int c = 0; c < 3; c++)
grid[r][c] = '.';
freeSlots = 9;
player = 'X';
hasWinner = end = false;
for (int r = 0; r < 3; r++) //print grid
{
for (int c = 0; c < 3; c++)
cout << grid[r][c] << ' ';
cout << endl;
}
while (!end) //while game is not over
{
row = col = -1; //get valid move
while (col > 2 || col < 0 || row > 2 || row < 0
|| grid[row][col] != '.')
{
cout << "Enter a row (1, 2, or 3) for player "
<< player << ": ";
cin >> row;
row--;
cout << "Enter a col (1, 2, or 3) for player "
<< player << ": ";
cin >> col;
col--;
}
grid[row][col] = player; //place move
freeSlots--; //decrement free slots
for (int r = 0; r < 3; r++) //print grid
{
for (int c = 0; c < 3; c++)
cout << grid[r][c] << ' ';
cout << endl;
}
//check game status
if (freeSlots == 0) end = true;
if (grid[row][0] == grid[row][1]
&& grid[row][0] == grid[row][2]) //Check row
hasWinner = end = true;
if (grid[0][col] == grid[1][col]
&& grid[0][col] == grid[2][col]) //col
hasWinner = end = true;
if (row == col && grid[0][0] == grid[1][1]
&& grid[0][0] == grid[2][2]) //diag
hasWinner = end = true;
if (row + col == 2 && grid[0][2] == grid[1][1]
&& grid[0][2] == grid[2][0]) //diag /
hasWinner = end = true;
//change player
if (!end) player = player == 'X' ? 'O' : 'X';
}
//display game result
if (hasWinner) cout << player << " has won ";
else cout << "Game draws ";
//Ask for another game
cout << " Do you want to play a new game?(y/n) ";
cin >> response;
cout << endl;
}
return 0;
}
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.