Author: Tim Foden
Date: 08:26:41 02/02/05
Go up one level in this thread
On February 02, 2005 at 09:02:44, Thomas Mayer wrote: >Hi Tim, > <snip> > >as you can see, GLC finds the draw at the same ply Quark does -> but the initial >score of Quark is quite better... well, that is my idea at the moment, I try to >get better scores as fast as possible. >So the recognizer tries to find draws or wins and the eval only tries to >differentiate between sure wins and maybe wins -> the search will guide it >wether it leads to a draw or to a win... In my opinion it is always good when >the eval has an idea about a maybe won position and a for sure won position. I agree with you. I've thought about doing these things myself... but I never seemed to have the time or the incentive. :) > So >in the search Quark would definitely prefer the won position to the maybe won >position... And the small 4men bitbases can help here a lot... Again, I agree. In GLC they would help a lot, as it doesn't support any tablebases at all at the moment (other than it's internal KPK one). I wondered about producing a bitbase generator myself, and giving the access code to the public domain. Keep up with your fun :) Cheers, Tim. >I really wonder >why Vincent thinks this is a stupid idea ?! > >Greets, Thomas
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.