Author: Brian Richardson
Date: 09:03:05 04/09/00
Go up one level in this thread
On April 09, 2000 at 07:33:12, Severi Salminen wrote: >Hi! > >>NPS is calculated differently in many programs, but I think it is generally the >>total number of nodes visited during the search, but not including evaluations, >>(which would be already counted as leaf nodes). NPS is not very useful as a >>speed measure. However, it is useful to the programmer to compare various >>versions of the same program. A more useful measure of speed would be the time >>to reach certain depths for several test positions (starting, various midgame, >>endgame). You could then compare your program's speed against several others >>that you could download. TSCP would generally be the slowest, and you should >>shoot for about 10x its speed. Crafty would be among the faster ones (but not >>fastest). > >Ok, thanks for explonation. So, if program performed a 2 ply search, it would >(at starting position) access to 20 nodes and 400 leaves? Did I understand >?-)Just to get these terms right... > >>PS Since you will soon (if not already) be spending most of your time debugging >>and testing, you may want to switch to C going forward. > >Well, you are not the first one to recommend switching to C, but since I started >with assembler I will end using assembler :) It is not so difficult to find bugs >when you make only small improvements at a time. > >Severi Leaf nodes are still nodes--so from the starting position there are 20+400 (some may say 421) nodes considering all possible moves. Naturally, A-B and others search techniques would reduce that number significantly.
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.