Author: Robert Hyatt
Date: 05:11:21 10/20/98
Go up one level in this thread
On October 20, 1998 at 05:53:19, Kai Lübke wrote: >On October 20, 1998 at 00:34:41, Komputer Korner wrote: > >>Bob why can't programs present the move list either in a log file or on screen >>in the alpha beta order? CSTAL does a 1 ply search to get the score evals for >>each legal move but unfortunately it doesn't list the moves in the alpha beta >>order of the engine search. Why couldn't a program do this? > >Isn't this what Fritz does in the "explain all moves" mode? > >--- >Shep If it does, it must search about 4 plies less deeply than normal. Typically the first move takes 50-90% of the total search time to evaluate. If we take the 50% number as a good case, to get scores for *every* move at the root of the tree, assuming there are 38 moves to be made, would require 19X as long to produce as just finding the best move and going on to the next iteration. With a branching factor of 3x this costs almost 3 plies. With a branching factor of 2.5X, this is more than 3 plies. Either is *hugely* expensive and makes such analysis useless...
This page took 0.01 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.