Author: Jon Dart
Date: 11:41:14 05/16/03
Go up one level in this thread
On May 16, 2003 at 12:22:14, Uri Blass wrote: > >I guess that you say that every position should be solved after a deep search by >a program that is not totally stupid. Generally, yes. But a failure to solve something can be due to something besides stupidity. Aggressive use of null move, for example, can make some problems unsolvable. That doesn't mean you have a bad program: that means you've done a risky optimization that works most of the time and sometimes causes anomalies. Most pruning techniques, in fact, have this general property. --Jon
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.