Interactive Tic-Tac-Toe game versus the test suite algorithms.
The contest will be 50 games of Computer first and 50 games of Player first.
The tic-tac-bots are not strong and are named Up, Down, and Random.
Initial board is zeros(3). Computer moves are 1s and Player moves are 2s.
Player output is an integer 1:9 to identify array position
1 4 7
2 5 8
3 6 9
Examples:
Input: [1 0 0;0 0 0;0 0 0] % Computer first case
Output: 5
Yields : [1 0 0; 0 2 0;0 0 0] with computer then picking position 2.
Second Input: [1 0 0;1 2 0;0 0 0] with computer's second move shown
.
Passing Score is 66 Wins out of 100 games.
It may be possible to score 100 Wins against the tic-tac-bots.
Your Total Wins will be displayed.
A follow-on problem will be 100 Tic-Tac-Toe Games: Never Lose Challenge
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers24
Suggested Problems
-
Which values occur exactly three times?
5239 Solvers
-
141 Solvers
-
Find perfect placement of non-rotating dominoes (easier)
382 Solvers
-
Golomb's self-describing sequence (based on Euler 341)
182 Solvers
-
Create an n-by-n null matrix and fill with ones certain positions
717 Solvers
More from this Author308
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!