Author: Richard Pijl
Date: 03:14:34 10/11/05
Go up one level in this thread
>Sorry Uri guess you missed this: > >"Tree search is one of the central algorithms of any game playing program. The >term is based on looking at all possible game positions as a tree, with the >legal game moves forming the branches of this tree." 'is based on' is the crucial part of the text here. Chess programs assess parts of the tree as irrelevant and won't get into that part of the search tree. >Why can't you understand this? >The analysis Window shows you how many possible moves are in a position, yes, the root position of the search. I agree all moves in the root position are examined. That is one position out of millions. >It shows you what move is being evaluated. It can even show you the line it is working on. That proves what? >It shows you the PV eval. Yes, evaluation of one line. It doesn't show you the evaluation of all possible lines in the gametree >Just look at the Window! I'm doing that often as part of programming a chessprogram. I know pretty well what the numbers in those windows mean! Richard.
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.