Average nodes per move = typical nodes per second x average time per move.crybotmark wrote:The hash size is 256 MB, but I don't know how would I get the average nodes per move using cutechess.
But I suppose your egine doesn't do more than 2Mnps, and since you seem to do 15"+0.3", and games typically last 60 moves, you must do at most 0.55 sec/move, and thus at most 1M nodes/move
Your hash table, however, contains probably 256M/16 = 16M entries,
So your search tree fits in the hash table 16 times, and because not every position in the tree will be unique, more likely 160 times. That means you are testing under conditions where basically no replacement is going on. So how do you want to draw conclusions on which replacemet strategy is better?
To do a meaningful test of replacement, the hash size should be ~100 times smaller than the tree size, rather than 100 times larger. So for a tree of 1M nodes, ~10K entries, or 160KB.