by bluesmoon
This implementation of tictactoe can have an NxN sized board, where N is an odd number >= 3. What makes this implementation different from others is that it does not use lookahead, and still never loses. It is more of an experiment than anything else.
hackrobat created the py-tictactoe tarball forum thread
17 December 2001 version 1.2.1 - Fixed one more losing case. Thanks to Philipp Niemann. 14 December 2001 version 1.2 - Changed scores to handle one losing case 1 December 2001 version 1.1.1 - Added comments into header files t3types.h and ...
bluesmoon committed patchset 3 of module pyctactoe to the Tic Tac Toe CVS repository, changing 1 files
bluesmoon committed patchset 3 of module tictactoe to the Tic Tac Toe CVS repository, changing 1 files
bluesmoon committed patchset 2 of module pyctactoe to the Tic Tac Toe CVS repository, changing 11 files
bluesmoon committed patchset 1 of module pyctactoe to the Tic Tac Toe CVS repository, changing 11 files
bluesmoon committed patchset 2 of module tictactoe to the Tic Tac Toe CVS repository, changing 18 files
bluesmoon committed patchset 1 of module tictactoe to the Tic Tac Toe CVS repository, changing 18 files
17 December 2001 version 1.2.1 - Fixed one more losing case. Thanks to Philipp Niemann. 14 December 2001 version 1.2 - Changed scores to handle one losing case 1 December 2001 version 1.1.1 - Added comments into header files t3types.h and ...
14 December 2001 version 1.2 - Changed scores to handle one losing case 1 December 2001 version 1.1.1 - Added comments into header files t3types.h and t3visual.h 9 October 2001 version 1.1 - Board size determined at run time thanks to Jesse ...
Copyright © 2009 SourceForge, Inc. All rights reserved. Terms of Use
