Tic Tac Toe: You will be given a series of moves in a Tic Tac Toe...

 

Transcribed Image Text:

Tic Tac Toe: You will be given a series of moves in a Tic Tac Toe (or Xs and Os) game. You have to figure out who the winner of the game is. Assume that the first move of the game is made by the player having X. Then the moves alternate between O and X. If X wins the game, print X (uppercase letter X). If O wins the game, print O (uppercase letter O). If it's a tie, print T (uppercase letter T). Each move is represented by two numbers r and c. They denote the coordinates of the square where the player has placed his/her marker (X or O). (1, 1) represents the top left corner and (3, 3) represents the bottom right corner. You have to take input continuously and stop as soon as someone wins. The winner might be determined in less than 9 moves but to guarantee a tie, you must take input 9 times. Sample Input 1: 11 12 21 22 31 X Sample Output 1: Sample Input 2: 13 11 22 31 21 23 32 12 33 Sample Output 2: Τ Hint 1: Notice that the coordinates given to you are starting from 1 but in arrays, we use 0 based indexing. Hint 2: Make a 2D array to store the state of the game. Create a function that takes the state as an argument and returns if the winner can be determined. Take input in the main function, change the state depending on input and call the function until a winner is obtained or all the 9 moves have been played. Tic Tac Toe: You will be given a series of moves in a Tic Tac Toe (or Xs and Os) game. You have to figure out who the winner of the game is. Assume that the first move of the game is made by the player having X. Then the moves alternate between O and X. If X wins the game, print X (uppercase letter X). If O wins the game, print O (uppercase letter O). If it's a tie, print T (uppercase letter T). Each move is represented by two numbers r and c. They denote the coordinates of the square where the player has placed his/her marker (X or O). (1, 1) represents the top left corner and (3, 3) represents the bottom right corner. You have to take input continuously and stop as soon as someone wins. The winner might be determined in less than 9 moves but to guarantee a tie, you must take input 9 times. Sample Input 1: 11 12 21 22 31 X Sample Output 1: Sample Input 2: 13 11 22 31 21 23 32 12 33 Sample Output 2: Τ Hint 1: Notice that the coordinates given to you are starting from 1 but in arrays, we use 0 based indexing. Hint 2: Make a 2D array to store the state of the game. Create a function that takes the state as an argument and returns if the winner can be determined. Take input in the main function, change the state depending on input and call the function until a winner is obtained or all the 9 moves have been played.

Answer rating: 100% (QA)

Heres a Python solution to determine the winner of a Tic Tac Toe game based on the provide... View the full answer