Author: Bob Durrett
Date: 17:22:51 12/10/02
Go up one level in this thread
On December 10, 2002 at 19:31:13, Chris Hull wrote: <snip> >As the game progresses, of course, there will be tactics, white >is trying to use his favorable positional advantage to force a favorable >tactical advantage. A new thought on this topic: As a practical matter, chess engines typically must find their moves within some externally imposed average time limit. Maybe one minute per move on average, for example. Suppose the chess engine programmer VERY MUCH wants to produce a chess engine which will play good positional chess, even with the time constraint. The time constraint may make it impossible for the chess engine to analyze the tree out to the point to where tactical evaluations can be performed. What could he/she do in that case? What might be worth trying? Perhaps the obvious answer is to design the position evaluation software so that it will give good values to good positional features. Isn't that really what modern chess engines do already, at least to some extent? Bob D. <snip> >Chris
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.