Author: Robert Hyatt
Date: 06:43:01 02/03/00
Go up one level in this thread
On February 02, 2000 at 21:57:27, Michael Neish wrote: > >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. I have answered this before. It "comes alive" after you learn how to use the idea. Two months isn't nearly enough time. Until you think "bit parallel" you write a traditional program using an ineffecient data structure. Once you get into bitboards, you begin to find faster or alternative ways to do thing...
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.