Author: Dann Corbit
Date: 10:42:50 06/20/03
Go up one level in this thread
On June 20, 2003 at 03:05:03, Uri Blass wrote: >On June 19, 2003 at 20:21:26, Dann Corbit wrote: > >>On June 18, 2003 at 14:07:15, Uri Blass wrote: >> >>>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. >> >>K^n = Tn >>K^(n/2) = K^n/K^2 == (1/K^2)Tn > >Wrong > >K^(n/2)is not K^n/K^2 >K^(n-2)= K^n/K^2 Cough. Quite right.
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.