Author: margolies,marc
Date: 07:22:13 11/07/03
Go up one level in this thread
it can be irrelevant with specific regard to the numerical efficiency of the algorythm. We all are familiar with orders of magnitude. I reminding you that while using even the case of identical datasets, algorythms perform jobs differently with respect to the scale of the data. What is efficient at one scale is too much work at another. Even when data is the same, and required output is the same, the amount of effort in clock cycles to do the job is different, has a different cost in resources. That's what makes them different. 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
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.