Author: David Blackman
Date: 23:45:31 04/09/99
Go up one level in this thread
I've downloaded it and had a quick look. There is probably one mistake: In search.c at line 182, in the function search(), where it says (nodes & 1000) i think this should be (nodes & 1023) or maybe (nodes % 1000) The idea here is he is trying to check the time once every thousand nodes, and the code he has doesn't do that. Another problem with this is nodes gets updated in qsearch() as well, so the time check code probably should be duplicated in there. I don't think this on its own should cause much slowness however. On Linux it certainly doesn't. I hope to get to a Sparc tomorrow long enough to give it a try.
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.