Author: Gian-Carlo Pascutto
Date: 05:48:25 11/21/01
Go up one level in this thread
On November 21, 2001 at 03:11:32, José Carlos wrote: > I used to limit it in the first versions of my program. Some day I commented >here and Christophe told me something like "there must be something broken in >your program; don't limit the qsearch, you'll save nodes because of the better >information". I fail to see how a 32 ply quiescent search will save nodes by giving better information to a 2 ply nominal search. > I fixed my problem (move ordering) and have been working perfectly since then. >I also did extensive testing some time ago and non-limiting-qsearch version got >better results. I'll test it in my program too (not now, it's on the dissection table :) but keep in mind that there are several ways to limit the quiescent search, and quite a bit of them are wrong. -- GCP
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.