Author: martin fierz
Date: 15:40:47 03/18/04
Go up one level in this thread
On March 18, 2004 at 16:44:54, Uri Blass wrote: [snip] >I know the algorithm to implement book but the problem is to implement it. >I wonder how did you start to think about that problem. >Did you start to read source code of free programs. > >I tried to look at crafty's source code and gave up after an hour. > >I understood that it has book_file and I also found that it generates it in the >first time in the bookup function but I did not understand how it is generated. >For some reason only opening the correct book file seem to be a lot of code. > >I guess that I can understand it if I spend many hours on it but I do not like >to do it because it means that I do not make progress for a long time and >implementing hash correctly first is more important. > >Uri why would you want to understand crafty's book code? of course i've also looked at parts of crafty for inspiration, although my program is quite different. but i would never even have thought of looking at book code. all you have to do is get yourself a list of positions with evaluations, then you stuff them in a big hashtable and use that to search the successor positions of the current position - then simply choose the move which leads to the best score. i wrote my book code in an afternoon. the real problem is to get a list of scored positions, of course, but i was lucky that a friend of mine had written a chess database and produced such a file for me :-) cheers martin
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.