Author: Mike S.
Date: 15:26:22 04/21/02
Go up one level in this thread
On April 21, 2002 at 18:15:06, pavel wrote: >(...) >If a program doesnt know "nada" about a position, deeper search wont do "nada". >:) Not true IMO. I think that in many cases, if there is "something" in a position, it should be visible much more clearly within a reasonable number of plies. There have always been examples where depth could replace knowledge. And if not, then "something" was probably just a Fata Morgana most often. There will always be exceptions. Some people say, (more) knowledge is just necessary because programs can't reach the depths to evaluate correctly (with lesser knowledge). Regards, M.Scheidl
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.