Author: Steve Lim
Date: 00:29:33 08/26/05
Hi All, I am trying to understand how to implement a simple minimax search into say a tictactoe program. Right now, my board is simply a [3][3] array. I have writen functions to check for initialize the board, draw the board, check for wins etc. So now its pretty much ready to referee a 2 player game. Where do I begin to implement the recursive minimax in this [3][3] board? How is the search done? Thanks. PS. My program was written from the beginning to scale to x by x size board (not just 3x3 tic tac toe), but I am having trouble detecting a diagonal win on a large board that doesn't begin in one of the 4 corners.
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.