Author: Dann Corbit
Date: 12:49:39 01/04/06
Go up one level in this thread
On January 04, 2006 at 14:52:06, Stuart Cracraft wrote: > >http://www.robinupton.com/research/phd/cp_intro.html > >So, has anyone actually used these CNS and CNS-derived ideas in >a chess program? I know about B* and Berliner. I want to know >about things more recent that at least *someone* can speak to >in the commercial or semi-commercial world. > >If you don't have actual data, how about theories on how these >would be used? > >It seems that determining the least number of nodes that would >have to change to affect the root score or growing the tree >in such a way that the conspiracy is as large or as small as >possible, could yield some interesting deeper searches. > >What is actual in regards to the above for computer chess? Conspiracy search: Alice by Sven Reichard Proof number search: Older versions of Sjeng by Gian-Carlo Pascutto Defeo (chess variant based on Sjeng) There is a checkers program called Dragon-draughts that uses proof number search There is a Go program called PubGo that uses proof number search It appears that Popeye and Natch (mate solvers) may be using proof number search There is a Connect 4 program called Velena by Giuliano Bertoletti that uses proof number search
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.