Problem 44364. Is this a valid Tic Tac Toe State?
For the game of Tic Tac Toe we will be storing the state of the game in a matrix M.
For this game:
We would store the state as this:
-1 1 1 1 -1 -1 1 -1 -1
If there were any blanks squares, they would be 0;
For this challenge, X goes first. Neither side is compelled to take a win if possible. The game stops when either player wins.
For this challenge, is the the given board state 0: legal 1: this state can not occur in a game
The example in the image would return 0 because if X goes first there can never be more O than X. The state matrix will only hold [-1 0 1], so we are only checking for logic of the game.
Solution Stats
Problem Comments
-
6 Comments
Sorry for my english... but i can not understand why the test 6 has y_correct=0. I think that my problem is in understanding the problem description.
In test 6, player 2 (-1) wins but player 1 (1) continues to play.
I would miss illegal x=[1 -1 -1;0 1 -1;0 0 1].
It's difficult to say something about x=[1 -1 -1;0 1 -1;1 0 1].
Did X win after missing a win or did X continue to play after a win ?
Technically it's a legal state no ?
@Jean-Marie Sainthillier: If we'd number the nine cells of the grid as [1,4,7; 2,5,8; 3,6,9], then a series of moves that would lead to x = [1,-1,-1; 0,1,-1; 1,0,1] without "insensible" moves for X (the commencing party) would be: X:5, O:7, X:3, O:8, X:9, O:4, X:1 ; in that case, X did not miss a win nor continue to play after a win.
So it is controversial situation. I mean it is pretty legal situation
Solution Comments
Show commentsProblem Recent Solvers118
Suggested Problems
-
6236 Solvers
-
3651 Solvers
-
16971 Solvers
-
Replace multiples of 5 with NaN
439 Solvers
-
374 Solvers
More from this Author51
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!