The game of Kurosu is simple. A square grid contains cells that can be filled with either a 'X' or an 'O', similarly to a tic-tac-toe board. Game rules are as follows:
1. The game is played on a 6x6 board.
2. Each row and each column must contain exactly 3 'X's and 3 'O's.
3. Only 2 'X's or 'O's can be placed consecutively, either in a row or in a column.
4. Diagonals are of no importance.
In this problem, given a completely filled Kurosu board, b, return 'true' if the board complies with game rules or 'false' if it does not. 'X's and 'O's are represented by 1s and 0s, respectively.
Example 1:
b = [1 0 1 0 0 1
1 1 0 1 0 0
0 0 1 0 1 1
0 1 0 1 1 0
1 1 0 1 0 0
0 0 1 0 1 1];
tf = true;
Example 2:
b = [1 0 1 0 1 0
1 1 0 1 0 0
0 1 1 0 0 1
0 1 0 1 1 0
1 0 0 1 0 0
0 0 1 0 1 1];
tf = false;
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers23
Suggested Problems
-
Project Euler: Problem 5, Smallest multiple
1649 Solvers
-
Project Euler: Problem 7, Nth prime
1751 Solvers
-
337 Solvers
-
Implement a bubble sort technique and output the number of swaps required
386 Solvers
-
150 Solvers
More from this Author45
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!