Author: Uri Blass
Date: 11:07:15 06/18/03
Go up one level in this thread
On June 18, 2003 at 14:00:19, Dann Corbit wrote: >On June 18, 2003 at 08:45:52, Uri Blass wrote: >[smip] >>No It is not logical. >>Better order of moves gives exponential speed up. > >A "mathematical exaggeration". >Perfect move ordering will reduce the number from K nodes to approximately the >square rook of K compared to random move ordering. k^n to k^0.5n is an exponential improvemrent. Even k^0.52n to k^0.51n is an exponential improvement. Uri
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.