Author: Uri Blass
Date: 17:01:06 10/10/01
Go up one level in this thread
On October 10, 2001 at 16:55:04, Dann Corbit wrote: >On October 10, 2001 at 16:51:30, Olaf Jenkner wrote: > >>Gustav needs 2 seconds to find the mate. > >Is that a proof, or is it a selective search? > >If mate is proven in 2 seconds, that is incredible. It is clear that it is a selective search because gustav is not a mate prover but a mate finder and it does not look for the shortest mate. Even chest cannot see the mate in few seconds but it has no problem to see no mate in 11 in relatively short time(some minutes on p200). 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.