Author: Vasik Rajlich
Date: 03:07:00 05/25/05
Go up one level in this thread
On May 24, 2005 at 18:49:05, Michael Yee wrote: >ACM/CSC-ER, >Proceedings of the 1983 annual conference on Computers : Extending the human >resource > >I just read this interesting paper (20+ years later!)... > >Main idea: > >Schaeffer essentially computes piece square table "bonuses" that depend on the >root position (e.g., plans like "king-side attack" or "try to occupy f5 with >your knight") and get added to the score of a branch in a path dependent way. > >Some questions: > >(1) Is this what Vincent Diepeveen sometimes referred to as "root processing"? > >(2) Does anyone know how Schaeffer's Planner compared to Wilkin's PARADISE (in >terms of playing strength)? > >(3) Is anyone experimenting with this or other types of path dependent eval? > >Steven is of course working on long-range planning. And I think Uri has some >path dependent stuff. But have most people pretty much abandoned it? > >Thanks, >Michael Just a terminological point - every engine does "long-range planning" by virtue of having an evaluation function. You could easily make a 1-to-1 mapping between any type of work done at the root and a pure static evaluation at the leaf. Vas
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.