Author: Brian McKinley
Date: 19:04:53 04/23/98
Go up one level in this thread
You are welcome to take a look at my classes. They uses 8 bit table lookups for just about everything. I imagine that the code can be improved since my program is only half as fast as crafty. Still, the classes encapsulate the complexity nicely. ftp://ftp.netcom.com/pub/mc/mckinley/chess/square.h ftp://ftp.netcom.com/pub/mc/mckinley/chess/board.h ftp://ftp.netcom.com/pub/mc/mckinley/chess/board.cpp Sorry about the lack of comments in the code. Suggestions for how to impove the code are welcome. I am new to chess programming. On April 23, 1998 at 04:50:56, Ernst A. Heinz wrote: >On April 22, 1998 at 16:57:00, Peter Fendrich wrote: > >>There seems to be different definitions of what rotated bitboards really >>are. I'm talking about rotating the diagonals. >> >>What should be called rotated? > >Please take a look at my ICCA Journal 20(3) article "How DarkThought >plays >chess" if you want to know how we do it. A preprint of the article is >available electronically on our "DarkThought" WWW page at URL: > > > >=Ernst=
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.