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

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.

4 Replies to “Tic-Tac-Toe”

  1. Pingback: Blue Planet Corporation » Blog Archive » Tic-Tac-Toe
  2. Pingback: Minimax with Alpha-Beta Pruning (2) - bluebones.net
  3. Pingback: Minimax with Alpha-Beta Pruning - bluebones.net

Leave a Reply

Your email address will not be published. Required fields are marked *

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.