Author: Gerd Isenberg
Date: 08:11:03 09/13/04
Go up one level in this thread
On September 13, 2004 at 10:38:21, Michael Henderson wrote: >That was great info everybody--thanks! > >So now I have these definitions: >I added in some more > >(depth = 3) pre pre frontier node >(depth = 2) pre frontier node >(depth = 1) frontier node >(depth = 0) horizon node? Yes, according to Ernst Heinz Papers. >(depth <= 0) qsearch node -- I don't increase my qsearch node counter when depth >== 0, though. >position with no successors searched = leaf node >non-leaf node = interior node > >more: >uppermost node = root node >PV node; (val > alpha) && (val < beta) >beta node: val >= beta >alpha node: val <= alpha http://utenti.lycos.it/gekochess/link/multiAlphaBeta.pdf 2.2. The Minimal Tree and Alpha-Beta Definition 2 ( Minimal Tree)
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.