Author: Steven Chu
Date: 04:18:12 03/28/03
Hi I am currently writing a chess program and trying to implement minimax or negamax with alpha beta pruning search algorithm with a quiescence search into the program code. Does anyone have any examples of this type of code so I can have a look and get an idea of what it should be like as I am having some difficulty with it at present. Thanks for the help Steven Chu
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.