Problem 44851. X O X Oh!
This follows on from problem 44850 - X O X O
https://www.mathworks.com/matlabcentral/cody/problems/44850-x-o-x-o
On a noughts and crosses board, how many possible unique combinations are there given a square grid of length n?
Assumptions/constraints:
- All squares are populated.
- Number of naughts and number of crosses can only differ by a maximum of 1 I.E. The game was played until the board was full.
- A solution with more than one "win" cannot be valid as the game would have finished before the board was full!
Solution Stats
Problem Comments
-
1 Comment
William
on 16 Feb 2019
I'm getting a different answer, by a few, than the test suite.
Solution Comments
Show commentsProblem Recent Solvers12
Suggested Problems
-
1221 Solvers
-
Calculate the height of an object dropped from the sky
227 Solvers
-
How long do each of the stages of the rocket take to burn?
259 Solvers
-
Sum the numbers on the main diagonal
567 Solvers
-
Create a two dimensional zero matrix
475 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!