Author: Michael Neish
Date: 18:57:27 02/02/00
Excuse me if I gripe. 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, a la TCSP. So where does the magic of bitboards come alive? It's certainly not in my case. Cheers, Mike.
This page took 0.01 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.