Author: JW de Kort
Date: 06:38:33 04/24/01
Go up one level in this thread
On April 23, 2001 at 08:56:23, José Carlos wrote: >On April 23, 2001 at 05:52:00, JW de Kort wrote: > >>Dear friends, >> >>I have added a qsearch to my program and as a result the number of nodes in my >>search has exploded. Sometimes the program searches ten times as much nodes in >>the qsearch than in the regular search. Can anybody give me some advice on >>methodes i can use to limit the number of nodes in the qsearch? >> >>Thanks in advance. >> >>Jan Willem > > Can't check it now (I'm at work), but I don't recall such an increase in nodes >searched in my program when I added qsearch. I guess you have something broken. >If you post your code here so we can have a look, we can try to help you. > Anyway, remember you can cut the search and return beta in case the static >eval is >= beta without searching anything at all. And remember that, if the >static eval is > Alfa, you can set Alfa = static eval. > > Hope this helps, > > José C. My code is not very fancy. I do not have the complete code from were i mail but essentialy this is what happens: At first a stand-pat score is calculated by using the evaluation function. Then all cpature moves are generated and sorted by value[captured pieces] - value [capturing piece]. All moves are testede using a standard alpha beta frame work. Basically i used dr Hyatts qsearch code as an example, leaving out the Swapfunction. Can you do something with this information? Jan Willem
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.