Author: Dan Andersson
Date: 10:16:37 01/11/02
Go up one level in this thread
Some hefty ply depths you are mentioning. I happen to agree in principle with them. But do you really think a program would survive if it searched eight ply less? Just joking:) The problem is that even the best evaluation available today is 'always' wrong, it will asses the static features but will have no clue of the future of the position. Thus missing the mark more often than not. The real mystery here is that current chess programs manage so well in the first place. Well, it's really no mystery but surprising none the less. MvH Dan Andersson
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.