Author: Anthony Cozzie
Date: 12:45:22 02/11/04
Go up one level in this thread
On February 11, 2004 at 13:44:31, Eli Bendersky wrote: >Hello all, > >I began publishing a new chess programming tutorial. It >follows my pet project of developing a chess playing agent >from scratch. The tutorial is released in stages, as soon >as I complete parts of the program. Each release includes >a new chapter of the tutorial (in PDF form) and all the >code for that release. The whole thing is free, of course, >including the code which is licensed with the GPL. > >I hope it will be of interest to people in this group. >You're welcome to check it out at: > >http://www.geocities.com/spur4444/prog/jamca/jamca.html > >Kind regards, >Eli IMHO, it is better to have a more compact piece representation. Zappa uses [P=1 .. K=6] << 1 + color, which works pretty well. This way is_pawn() and is_white() are also simple masks, but indexing into a table is not really possible with your approach (some 20 times larger -> not cache friendly). You will find that there are a lot of table index operations in a chess program. Also, I suggest just using a real bounds-checking c implementation like bounds-checking gcc or Valgrind. You will have many more array accesses than just a board. Good luck with your engine! anthony
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.