Author: Uri Blass
Date: 11:41:56 06/20/01
Go up one level in this thread
On June 20, 2001 at 14:25:03, John Hatcher wrote: <snipped> >Since, as I understand it, "nps" is related (at least nominally) to search depth >in a given time period, it would seem that, all things being equal, the greater >the "nps" the stronger the program. nps do not relate to search depth. A program that searches less nps can search deeper thanks to better order of moves or better search techniques(pruning or extensions). The main problem of chess programs is that they search illogical lines. If program knows to reduce the number of the irrelevant lines that they search they can search deeper inspite of searching less nodes per second. Another point is that I am not sure if nodes of Fritz has the same meaning as nodes of Tiger. nodes mean moves but the moves may be illegal and it is not clear that different programs generate exactly the same illegal moves. Uri
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.