Problem 2346. Tic Tac Toe Solver
Create a function that checks n number of tic tac toe boards housed in a 3x3xn matrix where the x's are represented as 1's (and o's as 0's) to determine which player won (if either) and which direction the win lies. 1=win for x's, 0=win for o's, -1=tie. 1=horizontal, 2=vertical, 3=diagonal, 0=not applicable (used for a tie). For example, in the following board:
0 1 0 1 1 1 1 0 0
the 1's player won in a horizontal direction: [1 1].
See the test suite below for more examples. The solution will be an nx2 matrix with one row for each board.
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers28
Suggested Problems
-
Return the 3n+1 sequence for n
8227 Solvers
-
1995 Solvers
-
The Hitchhiker's Guide to MATLAB
3276 Solvers
-
Convert given decimal number to binary number.
2014 Solvers
-
Convert to Binary Coded Decimal
130 Solvers
More from this Author139
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!