Author: Vincent Diepeveen
Date: 16:59:44 08/16/00
Go up one level in this thread
On August 16, 2000 at 18:52:03, David Rasmussen wrote: >My Qsearch usually takes up 70-80 % of the nodes searched. >What are the, say, 10 best ideas/techniques to cut this number down? I know of only 2 solutions. The first one is a rude one which bases upon a real bad evaluation: use a SEE. A Static exchange evaluation, which replaces the qsearch completely! No nodes wasted. In the end only this value is interesting. The second is if you want to focus in the future upon evaluation or want to pick up a load of tricks in the qsearch: that's writing a lot of chess specific code to figure out what moves to try in qsearch. Why try all checks? How about only the good ones? Why try a capture that's losing in advance? 70-80% sounds quite high to me, but in the end the accuracy of the score that gets out of the qsearch counts i.m.h.o. >P.S. I am writing a new chess program from scratch and I'm very much in love >with the scientific beauty of MTD(f). What are the pratical pros and cons of >doing MTD(f). What are the pitfalls etc. ? > >P.P.S. Why is my chess program code so messy?
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.