Author: Uri Blass
Date: 17:56:50 08/26/04
Go up one level in this thread
On August 26, 2004 at 19:25:01, Lance Perkins wrote: >I'm aware of the aparent advantages in cut-off situations. What I was hoping for >is that someone has the statistics that show that it is significant and worth >the effort to do. > >If someone already has the numbers, I don't want to have to write-up the code >just to prove it mysef. > >Stuart seems to have actually made the comparison, and found no advantage >whatsoever. I suppose it is due to a better move ordering when you actually have >all the moves to compare and sort (this is the same claim that Ed makes with >Rebel). > >I'm in no hurry to bloat the code for a minor gain. The reason not to have the code is not only move order but also evaluation. generating all the moves give me the number of moves. This is knoweldge and replacing that knowledge for some small linear speed improvement seem to me a bad idea. Movei have no function to generate only part of the moves(even no function to generate caprtures) and I believe that there are a lot of possible improvement to do for it without these special functions. qsearch is done by generating all the move and searching for captures or for checks in the first plies. Uri
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.