Author: Robert Hyatt
Date: 09:49:25 04/09/04
Go up one level in this thread
On April 08, 2004 at 09:38:09, Daniel Shawul wrote: >On April 08, 2004 at 09:14:05, martin fierz wrote: > >>On April 08, 2004 at 07:10:29, Daniel Shawul wrote: >> >>>Hi >>>Here are some questions >> >>[snip] >> >>>5.How do i measre my move ordering performance?Is it by counting only fail highs >>>of the first moves searched. It seems to me doing this measures performance of >>>hashtable since the hash move is the first searched. Or is it counting fail >>>highs of first x moves?? >> >>it's not measuring hashtable performance. you have more positions without hash >>moves than with hash moves... > > ok that's right. What I am getting is 16.7% fail highs at the first move >searched. I have heard many people report 80-90% move ordering efficiency. >Are they counting fail highs at 2nd,3rd,... moves too? My efficiency seems to >be too low compared to what i do in ordering. > You measure it as follows. If, at a node X, you fail high, you increment a counter "failed_high". If, at that same node you failed high on the first move, you increment a secound counter "failed_on_first". After the search ends, you compute fh = failed_on_first * 100 / failed_high. That ought to be 90% or higher most of the time. >> >>cheers >> martin
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.