There are lots of resources on the web about Minimax with Alpha-Beta pruning (the algorithm that forms the basis of most chess, draughts and other game-playing AIs). What I found missing when trying to implement it was a solid practical example. Hopefully this Java version of Noughts and Crosses (Tic-Tac-Toe) is one.
The classes for those interested in minimax with alpha-beta pruning are AI and Node
- Download Windows Installer with binaries and source code
- Download zip file with binaries and source code
Browse the source code | Browse the javadoc | Changelog
Joshua S. Gilpatrick rewrote my code to remove some of the extraneous detail and added a graphical board. You can download his code.
hai