Author: Dave Gomboc
Date: 15:35:23 08/27/03
Go up one level in this thread
On August 23, 2003 at 10:03:55, Dennis Breuker wrote: >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 Maybe I'm just remembering badly, but isn't there a pn^n search by now? That exponent just keeps increasing. ;-) Dave
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.