Author: Jari Huikari
Date: 06:03:46 10/20/98
Go up one level in this thread
On October 20, 1998 at 08:11:21, Robert Hyatt 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? >..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... What about only having higher value for beta cutoffs in Ply=2. Won't it find then exact values of the best replies for opponent and so with quite a low cost values for legal moves? Two plies minimax, the rest alpha-beta. Can it cost many plies? Jari
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.