Author: Robert Hyatt
Date: 08:10:51 11/08/03
Go up one level in this thread
On November 07, 2003 at 09:23:57, Gian-Carlo Pascutto wrote: >On November 06, 2003 at 23:48:19, margolies,marc wrote: > >>the topic of the thread is the algorythm, dave. the algorythms are different. >>that they search the same data in this is probably irrelevent unless you can >>show otherwise. > >How on earth can it be irrelevant when the amount of nodes searched >is the _key_ performance criterium? > >-- >GCP because the subject id depth-first vs breadth-first algorithms. They are _not_ identical. Unless you want to try to convince me that since bubble sort and heap sort produce the same final result, they are the same...
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.