Author: frank phillips
Date: 02:32:13 05/14/98
Can anyone point me in the direction of explanations of the techniques used in chess programming. Having learnt a bit of C this year and with the help of articles found on the Net about search algorithms managed to write crude connect4 and othello programs, I would now appreciate some pointers to simple but thorough and complete explanations of bitboards and hashtables. Several articles I have found partially explain these topics but usually assume that the reader has more knowledge than I do, perhaps because they assume a basic programming background which I do not have. The source code to Crafty (thanks Bob) is well documented but beyond me at the moment. On a specific issue, I would be grateful for an explanation of how to get a pv out of the (alpha/beta negamax) search. Everything I have tried so far based on storing the best move in an array pv[depth] has failed, so I seem to be missing a fundamental point - or am just plain stupid :-/
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.