An N N Tic Tac Toe game with an AI opponent build with minimax algorithm, α-β pruning, and a heuristic function. The bot looks four moves ahead to pick the next best move.

24-bit ANSI colored, console-based chess engine using Java. Optional multi-threaded AI using Minimax with alpha-beta pruning. Fully configurable properties including: ply depth, thread pool size, ...

there are a thousands of pages for this algorithm - plz post a link that you've used to implement this algorithm, or that you feel is the best coverage. thx for the pointers (i'll dig thru 10,200 ...