Author: Rémi Coulom
Date: 08:38:09 08/23/01
Go up one level in this thread
On August 23, 2001 at 11:08:54, Sune Fischer wrote: >Hi Folkes ;) > >I just upgraded my little engine from using a negamx to an alpha-beta algorithm. > >It is much faster, but still.... >With the negamax I had a branching factor of about 35 to 40, now is around >18-23. > >I get the feeling that that is still too high, I know it depends heavily on the >evaluation, but what kind of pruning cut-off should I realisticly expect with >the AB? You should not get such a high branching factor. You should get 6-7 if you do not use null move, I guess. I do not think it depends that heavily on the evaluation. It depends heavily on the move ordering, though. From theory, a perfect move ordering should give you a branching factor that is about equal to the square root of what you get with min-max. > >If may ask, what algorithm do you people use, is it alpha-beta or negascout >or...? >Is there a clear answer to what the best search algorithm is? Many prefer negascout. I do not believe there is a huge difference with basic alpha-beta. From the data you give about your results, I thing this is not what you should worry about right now. > >Cheers, >Sune Good luck with your program. Remi
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.