Author: Paul
Date: 11:41:42 11/15/01
Go up one level in this thread
On November 15, 2001 at 14:31:59, Gian-Carlo Pascutto wrote: >On November 15, 2001 at 14:07:13, Paul wrote: > >>Is there any known method of finding a shorter, or the shortest mate with >>proof-number search after a mate has been found? Is any research being done in >>that area that you know of? >> > >A simple method would be, after confirming the initial mate, to >simply set the proof and disproof numbers of any node of equal >or greater depth than the mate already found to huge values (even >those where there is a mate). > >This would guide the search away from longer mates. > >-- >GCP Care to try that? :) I'm curious ... Paul
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.