Re: Question.

[Mridul Muralidharan]

Hi Sternbach,

 A more useful approach would be not to improve the alpha-beta 
algorithm (though research sure is going on in this regard and GNUChess 
uses PV aspiration variation of alpha-beta - not vanila alpha-beta if 
I'm not wrong) , but improve the evaluation , improve the QSearch to 
eliminate horizon effects.
Especially QSearch.
 Currently QSearch in GNUChess  is limited to CheckEvasions() , maybe 
improve this to also include "good" checking moves , "good" tactical 
moves - like knight forks , etc.
Atleast I try these in my engine - with good results :)

Regards
Mridul


Sternbach, William [IT] wrote:

> Hello,
>
> I was wondering if the excellent algorithm that gnuchess uses can be improved.
> It is a worthy opponent, but it does lose occasionally.
>
> Is there any possible improvements to the alpha-beta pruning algorithms
> which might increase its ability to look ahead further and do more
> while using the same amount of CPU-time.  I have read some books on
> alpha-beta pruning algorithms (a long time ago when I was at Syracuse 
> University).
>
> I am a big fan of Deep-blue, and as PC's are getting faster and faster
> (Passing the 3GHZ mark), is there any plans to improve the gnuchess algorithms
> to potentially bring it to a "master" level?
>
> - Bill
>
>
> _______________________________________________
> Info-gnu-chess mailing list
> Info-gnu-chess@gnu.org
> http://mail.gnu.org/mailman/listinfo/info-gnu-chess
>
>