Author: Bruce Moreland
Date: 14:24:36 08/31/01
Go up one level in this thread
On August 31, 2001 at 11:53:44, Gian-Carlo Pascutto wrote: >On August 31, 2001 at 11:40:10, Dieter Buerssner wrote: > >>On August 31, 2001 at 11:17:22, Gian-Carlo Pascutto wrote: >> >>>Deeper Blues's predecessors predecessors predecessors predecessor >>>already found it 4 ply _earlier_ than Yace. >> >>With a one line change in the source (relaxing the restriction on "selective >>depth"), Yace can find it at depth 6: > >You are tuning for a position. Everyone figures out about single-response extension eventually, but I think that most constrain it. The degree to which you constrain it controls how fast you find stuff like this, and how much time you waste looking for stuff like this when it's not there. What Mr. Buerssner is saying is that he can turn down the constraint and he'll find it faster than he does now. He means that how fast he finds this is a deliberate *choice*. If you have a program that finds it faster, it's not necessarily better, it could just have the contraint turned down. That Deep Thought finds this in some finite time means nothing. Anyone can solve this problem in a very short time if they want to. bruce > >If I hardcode it into Sjeng, it finds it in 0 sec at ply 1. > >But that won't help me in actual play. > >>John Merlino even has shown a better result. > >I wont contest that. But it still means nothing about DB. > >-- >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.