Author: Bruce Moreland
Date: 18:11:48 08/30/01
Go up one level in this thread
On August 30, 2001 at 18:53:56, Sune Fischer wrote: >Hi > >I see a lot of you printing principal variations (not the algorithm, but the >best lines of play) found in the searches. How do one obtain that information, >the alpha-beta only returns the score, not the moves? >Perhaps it is possible by saveing every move that sets a new alpha (resp. beta) >value. The move that exceeds the beta (resp. alpha) is not the one we want, but >the second best before that, right? >Now here's where I get lost I think, what happens after we've gone back up the >tree and then down a new branch to the same level as before. If a we get a new >alpha won't that mess up the last move we saved (global vars), and what if it >wasn't better? >Maybe this won't happen because these braches will be pruned off before that >occurs or what? Hmm I'm having some trouble grasping this part. > >I'm also looking for some kind of tutorial on hash tables, how to build them, >what to store in them etc. (a step by step guide really;). > >Thanks, >-S. http://www.seanet.com/~brucemo/topics/pv.htm bruce
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.