Author: Klaus Friedel
Date: 11:15:12 01/19/04
Go up one level in this thread
On January 19, 2004 at 03:04:48, Tord Romstad wrote: >Hi Klaus, > >Thanks for your answer! > >On January 18, 2004 at 06:34:03, Klaus Friedel wrote: > >>Nevertheless I think that PN search is a concept with some potential if one >>finds a way to reduce its huge memory requirements and find the right goals to >>search for. > >There has been a lot of work on reducing the memory requirements. Take a look >at PN2 or PDS-PN. In particular, PDS-PN reportedly performs well with only a >tiny amount of memory. PDS-PN is described in the following paper by >van den Herik, Uiterwijk and Winands: > >http://www.springerlink.com/app/home/contribution.asp?wasp=mm8xd75n4l3vtgfcbq5r&referrer=parent&backto=issue,5,27;journal,36,1408;linkingpublicationresults,id:105633,1 > >Finding the right goals to search for is, of course, the really hard >problem. :-) > >Tord Hmm, the link doesn't work for me ? Bye, Klaus.
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.