Search algorithm query

[Denis P. Mendoza]

I just want to know, if it is feasible, at what condition below we could say an engine is statistically having the right search algorithm. As an example, let us say that the engine is searching given a certain test position for the right move, at a FIXED time.

1. SD low, SELD low, NC high, NPS high
2. SD high, SELD high, NC high, NPS high
3. SD low, SELD high, NC high, NPS high
4. SD high, SELD high, NC low, NPS low
5. SD high, SELD low, NC low, NPS low
6. SD high, SELD low, NC high, NPS high

where: SD=searched depth, SELD=selective depth
NC=nodecount, NPS=nodes/sec

[Aleks Peshkov]

IMHO time to solution comparing to known good engines does only matter.