Author: Uri Blass
Date: 18:12:42 05/24/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"? Yes but only the part of the piece square table that is dpendent on the root position. The problem is that the program use the root position to evaluate the leaves and it is not good. > >(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 I have path dependent stuff but no computing piece square table "bonuses" that depend on the root position. I do not consider piece square table bonuses that depend on the root position as planning. Path dependent stuff is more related to planning but I still do not consider it as planning and it only can help to make the illusion of planning. It is something very simple relatively to what Steven is doing. Uri
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.