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
798 Solvers
Sum of diagonal of a square matrix
1159 Solvers
535 Solvers
Make a run-length companion vector
453 Solvers
Check if number exists in vector
2318 Solvers
Problem Tags