Currently, I''m writing a Java program for my assignment on a board game, Gomoku. Gomoku is a 2 player game, just like a tic-tac-toe game, except that it is 5-in-a-row. In this assignment, I would like to implement Minimax with Alpha-beta pruning; the reason I want to use the minimax with alpha-beta pruning is to make my computer to have a better running time. but I still don''t have any idea how to put this approach into my Java code. If I create a method called minimax(), what parameters should I pass into? How minimax works recursively? How minimax find its best move from the tree generated?

Here you go...

http://www.seanet.com/~brucemo/topics/alphabeta.htm



Stimulate