Author: Uri Blass
Date: 12:42:39 08/21/03
Go up one level in this thread
On August 21, 2003 at 14:48:55, Sune Fischer wrote: >On August 21, 2003 at 14:35:25, Omid David Tabibi wrote: > >>>>"Assumption is the mother of all f**k-ups" :) >>> >>>Then you can disable nullmove as well, that f**k ups as well some times. >> >>I use verified null-move pruning, it doesn't f**k-up :) > >Then it comes at a cost. >You can't make a strong program without doing certain assumptions. Your assumption is wrong. You can do it. Note that verified null move pruning does not cover all zugzwangs. I believe that it is possible to cover all the problem without costs or at least without significant costs(being 5% slower is not a significant cost) You can decide every time that you search to depth x with pruning to search also to depth x/4 without dangerous pruning and if the score at depth x/4 suggest dangerous zugzwang to stop using dengerous pruning. By this idea you can practically solve everything after enough time. I do not say that it is the best solution but only demonstrates a possible solution to the problem. The reason that programs do not solve simple positions is only the fact that programmers decide that it is not important for them. generating a strong program does not contradict being able not to do stupid blunders. Uri
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.