Author: Leen Ammeraal
Date: 22:15:23 08/14/01
Go up one level in this thread
On August 14, 2001 at 20:02:54, Sune Fischer wrote: >Hi > >I have been trying to implement an AB algorithm. >I have done a lot of searching on the net, >the best pseudo code I found was here: >http://www.xs4all.nl/~verhelst/chess/search.html#alpha-beta > >Something is missing though, this function returns only a value, >not the best move. You should make each move of the move list you generated, and each time you should call the alpha-beta function just after this move (and you unmake the move after this call). When a return value of this function is better than all others so far, you should store not only this value but also the move in question. At the end you have both a value and the corresponding move. Leen Ammeraal http://home.wxs.nl/~ammeraal/
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.