Author: Michael Yee
Date: 15:49:05 05/24/05
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
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.