Author: Theo van der Storm
Date: 13:13:08 11/11/05
Go up one level in this thread
On November 11, 2005 at 15:41:24, Martin Giepmans wrote: >On November 11, 2005 at 15:30:59, Dann Corbit wrote: > >>On November 11, 2005 at 15:12:14, Maurizio Monge wrote: >> >>>Hi, >>>i've found that there was a lot of research about conspiracy numbers search >>>algorithms. >>>Does anybody know if someone tried to make a chess program with it? >>>AFAIK, it is not used on any modern chess program that i know of (like fruit, >>>crafty, etc), does this means that the idea cannot be succesfully applied to >>>chess? >> >>It is used to prove mates and things like that. >>GCP did use it in a pervious version of Sjeng. > > >I think what GCP used was proof-number search. >IIRC, Ulf Lorenz of Paderborn University used conspiracy numbers search in his >chess engine (on a parallel computer with many processors). > >Martin And Maarten van der Meulen was one of the first to use it. m1.0. Theo
This page took 0.01 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.