Author: Uri Blass
Date: 11:02:13 09/27/05
Go up one level in this thread
On September 27, 2005 at 13:21:38, Steve Maughan wrote: >Uri, > >>He clearly knows that there are search bugs and not solving fine70 fast is an >>example for it. > >Fine 70 is all about hash tables. Conventional wisdom is that if everything is >working well with the hash table then you'll be able to solve Fine 70 quickly >(<25 ply search). But Fruit has a unconventional hashing scheme (upper and >lower bound for each entry) so it may well be the case that this scheme is not >good for Fine 70 but excellent overall. So I wouldn't call the inability to >solve Fine 70 a bug. I assume you'll disagree. > >Regards, > >Steve I do not understand how having upper and lower bound bound can prevent a program to solve fine 70 in a short time. There is no contradiction between having a productive change and having a bug and a productive change may include a bug. Uri
This page took 0.01 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.