Author: Larry Griffiths
Date: 07:45:22 07/20/00
Go up one level in this thread
On July 19, 2000 at 23:13:09, Robert Hyatt wrote: >The original chess 4.x used this incremental move generation scheme. I did it >early on in crafty, but found that the compute-on-the-fly approach using rotated >bitmaps was faster and simpler. But there is nothing basically wrong with the >incremental approach, other than complexity... Hi Robert, I think I have the bitboards working for move generation now. I am using a double linked list for this incremental scheme. I can only get about 1 to 2 millions moves per second so far, and that is without move validation. I have some nasty bug I am trying to find at this time. I guess hair-brained is well translated to "Complex". Larry.
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.