X and 0

 

Home
Products
Real Cut 2D
Real Cut 1D
Data Analyzer
Cut 2D X
Cut 1D X
X and 0
Data Analysis X

       How fast is your strategy for X and 0 game?

How fast is your strategy for X and 0 game?

No ASM!!! No Parallel implementations!!! C++ only!!!

Game was tested on a Intel Celeron 850 MHz processor with 128 Mb RAM under Microsoft Windows 98 (c).

 

Game Description

In Tic-Tac-Toe (TTT or Naughts and Crosses, or X and 0) there are two players and a 3 ´ 3 grid. Initially the grid is empty. Each player moves in turn by placing a marker in an open square. By convention, the first player’s marker is “X” and the second player’s marker is “0”.

The player that put three markers of his type (“X” for the first player and “0” for the second player) in a row is declared the winner.

The game is over when one of the players wins or all squares are marked and no player wins. In the second case, the game ends with draw (none of the players win). Enumerating the game tree shows that the second player can obtain at least a draw.

 

Download the Borland C++Builder 6.0 implementation of this Program for free.

Contact us at contact@optimalprograms.com if you are interested in this kind of strategies.