Author: Uri Blass
Date: 11:23:19 04/05/03
Go up one level in this thread
On April 05, 2003 at 14:06:05, Russell Reagan wrote: >On April 05, 2003 at 13:52:54, Angrim wrote: > >>Hmm, do you mean 9% faster NPS? if so your move ordering has likely been >>hurt by the new hash method, since no way the hashing was taking 9% of >>the time before. > >It was 9% faster in calculating perft, so no move ordering. The only thing I can >think of is that the CPU liked working with two 32-bit keys seperately instead >of one 64-bit key. Maybe the compiler was able to perform an extra optimization. >Who knows. It is possible. It happened to me today that I added a function to my program and I wanted to check how much slower my program becomes from it(only from calculating the information without using it). I was surpried to find out that it became 1% faster. 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.