Tic-Tac-Toe For this question, you will be implementing a simple Tic-Tac-Toe game without the graphics. Here is how it works: • First, it is randomly determined if the user starts the game or the computer and this information is shown to the user. The player who starts always starts as "X". • The players (computer and the user) will then take turns in playing. The computer will choose a random empty spot on its turn. The user enters its choice in the console. • Each of the empty spots have a corresponding number that the players choose on their turn. If the user enters anything other than the number of an empty spot (not yet filled with "X" or "O"), it will not be accepted, and they will be prompted to enter a correct number. 2 4 7 8 • After each turn, two things need to be done: 1) displaying the updated board 2) checking if anyone has won (it should be printed who has won – the user or the computer). The game goes on until someone wins or until all the 9 empty spots are filled and no one has won. When the game ends, the user should see the message saying who has won (even if no one) Implementation details You should implement at least the two following functions. The printings, messages, and shape of the board should match the gameplay example. displayBoard(board) Parameter board is a dictionary containing the non-empty spots of the board. This function does not return anything. It will just print the content of the board as depicted in Gameplay example. haswon (board) Parameter board is a dictionary containing the non-empty spots of the board. This function determines if anyone has won and returns a suitable value (up to you how you want to handle the returned value). 3. 6.
Tic-Tac-Toe For this question, you will be implementing a simple Tic-Tac-Toe game without the graphics. Here is how it works: • First, it is randomly determined if the user starts the game or the computer and this information is shown to the user. The player who starts always starts as "X". • The players (computer and the user) will then take turns in playing. The computer will choose a random empty spot on its turn. The user enters its choice in the console. • Each of the empty spots have a corresponding number that the players choose on their turn. If the user enters anything other than the number of an empty spot (not yet filled with "X" or "O"), it will not be accepted, and they will be prompted to enter a correct number. 2 4 7 8 • After each turn, two things need to be done: 1) displaying the updated board 2) checking if anyone has won (it should be printed who has won – the user or the computer). The game goes on until someone wins or until all the 9 empty spots are filled and no one has won. When the game ends, the user should see the message saying who has won (even if no one) Implementation details You should implement at least the two following functions. The printings, messages, and shape of the board should match the gameplay example. displayBoard(board) Parameter board is a dictionary containing the non-empty spots of the board. This function does not return anything. It will just print the content of the board as depicted in Gameplay example. haswon (board) Parameter board is a dictionary containing the non-empty spots of the board. This function determines if anyone has won and returns a suitable value (up to you how you want to handle the returned value). 3. 6.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Transcribed Image Text:Tic-Tac-Toe
For this question, you will be implementing a simple Tic-Tac-Toe game without the graphics.
Here is how it works:
• First, it is randomly determined if the user starts the game or the computer and this
information is shown to the user. The player who starts always starts as "X".
• The players (computer and the user) will then take turns in playing. The computer will
choose a random empty spot on its turn. The user enters its choice in the console.
• Each of the empty spots have a corresponding number that the players choose on their
turn. If the user enters anything other than the number of an empty spot (not yet filled
with "X" or "O"), it will not be accepted, and they will be prompted to enter a correct
number.
2
4
7
8
• After each turn, two things need to be done: 1) displaying the updated board 2) checking
if anyone has won (it should be printed who has won – the user or the computer).
The game goes on until someone wins or until all the 9 empty spots are filled and no one
has won. When the game ends, the user should see the message saying who has won
(even if no one)
Implementation details
You should implement at least the two following functions. The printings, messages, and shape
of the board should match the gameplay example.
displayBoard(board)
Parameter board is a dictionary containing the non-empty spots of the board.
This function does not return anything. It will just print the content of the
board as depicted in Gameplay example.
haswon (board)
Parameter board is a dictionary containing the non-empty spots of the board.
This function determines if anyone has won and returns a suitable value (up to
you how you want to handle the returned value).
3.
6.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 2 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY