Author: Colin Frayn
Date: 04:57:33 02/03/00
Go up one level in this thread
On February 02, 2000 at 21:57:27, Michael Neish wrote: >I just spent two months converting my program to >bitboards and when I finally removed all the obvious bugs I find it's searching >about 30% slower than the original routine, which just used simple arrays and >loops to generate moves I just use simple arrays, and to be honest they're pretty fast if optimised well. In my program I found that the bottleneck as far as move generation goes is generating non-quiescent moves for the quiescence search. I also spent a lot of time speeding up check testing functions so that they barely have any effect on the overall time now. The two most time consuming functions by a long way are the two I use for board analysis. My analysis function is rather complicated so it tends to take quite a long time to run. I found that this gave lots of nice benefits. I don't know how fast one can get a move generator working, but to be honest if mine ran instantaneously, then it would speed up my program by maybe 30-40% at very most so I'm not bothering with bitboards, though I expect they would also speed up the static analysis too.... Perhaps I ought to improve my move ordering a little! :) Cheers, Colin
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.