Author: José de Jesús García Ruvalcaba
Date: 02:47:31 08/15/01
Go up one level in this thread
On August 15, 2001 at 01:55:22, Bruce Moreland wrote: >On August 15, 2001 at 01:37:41, Sune Fischer wrote: > >>On August 15, 2001 at 01:15:23, Leen Ammeraal wrote: >> >>Hi >> >>>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/ >> >>Yeah, I think that is what my ABsearch function does. >>Maybe I need to flip the alpha and beta values when going from ABsearch to AB? >>I'm not sure, but something is wrong. >> >>-S. > >http://www.seanet.com/~brucemo/topics/alphabeta.htm > >I banged this out and put it on the web page rather than writing this up again. >Near the end of the page is the algorithm in pseudo-C that's not so pseudo that >you won't be able to code it. > >bruce Hi Bruce! I found your computer-chess pages extremely interesting. I recommend them to the whole community, and I hope you have time to add a few things every now and then. I will send you more comments by e-mail. José.
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.