[computer-go] Evaluation speed

["Antoine de Maricourt" <antoine.de-maricourt@xxxxxxx>]

Hi there - and happy new year to everybody

I would be interested to know how people compute evaluation speed, when
announcing 500 nodes per second, or 800k nodes per second. In the first
case, it seems that the speed is for some kind of top most heuristic,
which - as I understand from a previous thread - probably performs search
(at probably higher speed).

Also, when a node is reached and its value is retrieved from a hash table,
is it taken into account in the evaluation speed? On one hand, the node is
generated, thus could be counted. On the other hand it is not really
evaluated...

When you have a evaluation function, that perform a one (or two, or
three)-ply lookahead, but is harcoded, are nodes (that are not really
expanded, as the lookahead is harcoded) taken into account?

When a position is evaluated by a top level heuristic, which in turn calls a
sub-search with a simple goal oriented heuristic, is the node counted twice
(once for each heuristic)?

Is there a well defined method to measure evaluation speed?

    Antoine.

_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://computer-go.org/mailman/listinfo/computer-go