Author: Dennis Breuker
Date: 07:03:55 08/23/03
Go up one level in this thread
On August 22, 2003 at 11:38:07, Gian-Carlo Pascutto wrote: >On August 22, 2003 at 11:36:32, Omid David Tabibi wrote: > >>On August 22, 2003 at 11:09:23, Gian-Carlo Pascutto wrote: >> >>>On August 22, 2003 at 10:54:17, Steven Edwards wrote: >>> >>>>BUT, the above mentioned Paradise chess program pulls out the mate PV with a >>>>search tree containing only 109 nodes. It solves many other tactical puzzles >>>>with similarly small search trees. >>>> >>>>Are there any programs out there today that emphasize knowledge per node rather >>>>than nodes per second? >>> >>>With PN2 search, >> >>PN2?! > >'proof number squared' search > >Look for Victor Allis's thesis. And mine (Chapter 4). http://www.breuker.demon.nl/thesis/index.html Dennis
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.