Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Topics: User Defined Functions and MATLAB Conditionals A Childrens game studio needs you to write a MATLAB Program to allow two players to play the

Topics: User Defined Functions and MATLAB Conditionals

A Childrens game studio needs you to write a MATLAB Program to allow two players to play the game Tic-Tac-Toe on a computer:

This is a two player (X's and O's) board game.

The game board is a 3 X 3 grid, where each location can hold either an 'X' an 'O' or a space (empty) Note: we will linearize the grid and refer to the its locations as 1 - 9, for conveyance.

The players take turns placing their mark into one of the (empty) locations in the grid.

The game is won when a player has their mark in all three locations of any row, column, or diagonal.

The game can also reach a stalemate: neither player has won (by above criteria) however all there are no more empty locations in the grid.

Outline:

Create a MATLAB Script .m file

Establish variable(s) to represent the nine board locations

Create the game loop

i.Display the current state of the board using separate displayBoard function

ii.Get a valid move location note this can only be an empty location [1, 9]

iii.Modify the board variable(s)

iv.Check for a win and report it if so game must end

v.Check for a stalemate game must end

Create a MATLAB Function .m file

Establish its name (displayBoard), input(s) , and output (there really is not any)

Write the necessary MATLAB commands to display the Tic-Tac-Toe board, using the given input(s)

Make sure to test your script and function when they are done

Notes(s):

Keep track of the total number of moves, for an easy stalemate detection.

Your location choice user-validation loop must also not accept any location that is not currently empty.

At times things will feel very tedious - doing the "same" thing nine times ...

Sample Run(s):

Welcome to Tic-Tac-Toe : X goes first

-------------------------------------

| |

---------------

| |

---------------

| |

Please enter location to move [1 - 9] : 10

Please enter location to move [1 - 9] : -1

Please enter location to move [1 - 9] : 1

X | |

---------------

| |

---------------

| |

Please enter location to move [1 - 9] : 1

Please enter location to move [1 - 9] : 2

X | O |

---------------

| |

---------------

| |

Please enter location to move [1 - 9] : 3

X | O | X

---------------

| |

---------------

| |

Please enter location to move [1 - 9] : 4

X | O | X

---------------

O | |

---------------

| |

Please enter location to move [1 - 9] : 5

X | O | X

---------------

O | X |

---------------

| |

Please enter location to move [1 - 9] : 6

X | O | X

---------------

O | X | O

---------------

| |

Please enter location to move [1 - 9] : 7

X | O | X

---------------

O | X | O

---------------

X | |

Congrats - X Wins!

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Graph Databases In Action

Authors: Dave Bechberger, Josh Perryman

1st Edition

1617296376, 978-1617296376

More Books

Students also viewed these Databases questions