Author: Tony Werten
Date: 07:30:26 02/23/03
Go up one level in this thread
On February 21, 2003 at 23:48:52, Robert Hyatt wrote: >On February 21, 2003 at 13:26:34, Alvaro Jose Povoa Cardoso wrote: > >>Could someone please define what "ALL node" is and axplain how do we process >>these type of nodes? >> >>Best regards, >>Alvaro Cardoso > >If you look at a perfectly ordered alpha/beta tree, after you search the first >branch at a node to establish alpha, you search the rest of the branches, and >at each successor you search only one node (the refutation move). But at the >next ply below that you have to search _all_ moves. This alternates down >through the tree. At "all" nodes, move ordering is totally irrelevant. At >successors to all nodes, you get "cut" nodes where you only need to search one >move, if you can search a good move first... If you're sure the other moves don't give a cutoff, why bother searching them at all ? Tony
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.