Author: Peter Fendrich
Date: 15:02:16 08/14/03
Go up one level in this thread
On August 14, 2003 at 16:18:50, Gian-Carlo Pascutto wrote: >On August 14, 2003 at 15:27:06, Peter Fendrich wrote: > >>1FH = The ratio where the first generated move in the node is a Fail High. >> >>I experimented with removing the the hash table and became a bit surprised. >>Normally I have about 1FH = 95-96%. When I removed the hash table that figure >>raised to more like 1FH = 96-97% while the search depth, as expected, was >>decreased. >> >>Increased 1FH when removing the hash table. Is this normal? > >In my program, move ordering worses when I disable hashing. Well, it should be the same in mine program as well and the reduced search depth implies that this really is the case. >Do you handle the case where there is no reliable move in the hash? This is why I started to do the test in the first place. I wanted to test a new idea instead of IID which is quite expensive. For this test I disabled both the new idea and IID. Left was only good captures, Killer moves and other well known methods to sort the moves. Without the hash moves the search tree becomes bigger allright. Maybe it's possible to get higher values for 1FH and still have a bigger search tree and worse move ordering. I don't understand how, though... /Peter >-- >GCP
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.