Author: Steven Edwards
Date: 05:36:38 06/28/05
Symbolic: Micro status update 2005.06.28 Symbolic's ChessLisp source is now able to completely explore a multilevel adversarial plan including subgoal elaboration at different ply depths and plenty of narration. This means that the ExpPlan and ExpPlayMove sequencers are successfully calling each other recursively to traverse the HTN (Hierarchical Task Network) plan. Some test results are linked at the updated web site: http://www.geocities.com/chessnotation The latest run was made on a 1.13 GHz Pentium III running Linux. The node exploration rate was about seven per second. I had hoped for a slightly faster rate for this platform, but it's still acceptable. The raw Lisp evaluation rate is slightly over 300,000 symbols per second. A big change from the earlier version is that each node in the position search tree now retains the most recent analysis (score, PV, etc.) for that position. Not only does this help with debugging, but more importantly it assists with being able to suspend/resume the search at different points in the position search tree. This ability is needed to better mimic the human progressive deepening process.
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.