Author: Robert Hyatt
Date: 20:24:24 04/07/04
Go up one level in this thread
On April 07, 2004 at 15:38:59, Tony Werten wrote: >On April 07, 2004 at 11:04:23, Robert Hyatt wrote: > >>On April 07, 2004 at 10:54:40, Tony Werten wrote: >> >>>On April 07, 2004 at 10:48:23, Renze Steenhuisen wrote: >>> >>>> >>>>>>>>>I'm sure it was some implementation bug with Renze. >>>> >>>>Anyone, >>>> >>>>I only store result from the main search, so no NULL-move and no Qsearch >>>>results. >>>>I get a TT-hit ratio of 11.73%, of which a part will generate cut-offs. >>>> (I call something a tt-hit when an entry is found with the same hashkey, >>>> draft does not need to be sufficient) >>> >>>Hmm, I'm sorry but that's way too low. You probably have a problem with your >>>hashkey. >>> >>>In XiniX I get a hitrate of at least 60% in normal search, >20% in qsearch. >> >>That can't be right unless you are talking positions like Fine 70... >> >>Too many have run that experiment over the years and 30% is the _highest_ number >>I have ever seen reported in opening/middlegame positions. > >:) We have different programs. Yes, but I don't see how you can search a tree this large, and get 60% raw hash hits. That says that you are seeing an incredible number of transpositions. I have seen numbers this high (or even higher) with mtd(f) of course, but there the tree is searched multiple times at the same depth... > >The 60% is raw hits, and without leaf nodes ( I have them in quiescence hits ). >In total it would average to 30% i guess. (Can't check now) If you get 30% q-search hits, that would be _very_ good since they are all useful (no draft problems). > >I think my singular extensions and checks in quiesc make sure it searches the >same tree often. It has to, since it only searches max 200Kn/s and at that speed >you can't afford to have an unstable search. > >I can't really compare it to previous version, since the engine has been buggy >for the last couple of months, and I didn't measure these numbers before. > >But the search seems normal again ( finally ) where normal means not enough >average searchdepth but some nice deep forcing lines every now and then. > >Tony > >> >> >>> >>>Tony >>> >>>> >>>>the tt_retrieve code retrieves a move, which I call the TT_MOVE_SUGGESTION. >>>> >>>>could someone provide me with a % of TT_MOVE_SUGGESTIONs in a search? >>>> >>>>Cheers...
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.