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, given a game state, does X (1) have a three in a row on any row, column or major diagonal?
Solution Stats
Problem Comments
-
2 Comments
Sean de Wolski
on 17 Oct 2017
Solution 7 should be correct. The diagonal of -1s is a valid win.
Hope all is well with you, Doug!
Ned Gulley
on 17 Oct 2017
@Sean, I think Doug's got it right. He's asking only if the X side (that is +1) is in a winning position. In test 7, the O side (-1) is in a winning position. So the answer given is correct.
Solution Comments
-
1 Comment
Daniel
on 18 Dec 2017
Shouldn't Test 7 be y_correct = 1?
-
1 Comment
Michal Dobai
on 15 Dec 2017
To be fair, you didn't mention anything about anti-diagonal in your problem description (test no. 4). Or am I missing something?
Recent Solvers339
Suggested Problems
-
The Hitchhiker's Guide to MATLAB
2607 Solvers
-
590 Solvers
-
417 Solvers
-
261 Solvers
-
166 Solvers