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
Solution Comments
Show comments
Loading...
Problem Recent Solvers536
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
6821 Solvers
-
It dseon't mettar waht oedrr the lrettes in a wrod are.
2160 Solvers
-
500 Solvers
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1328 Solvers
-
Write c^3 as sum of two squares a^2+b^2
331 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!
Solution 7 should be correct. The diagonal of -1s is a valid win.
Hope all is well with you, Doug!
@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.