|
| 711k download - pdf version |
|
|
| 19 November, 2009 - A Proposed Heuristic For a Computer Chess Program |
Download Adobe Acrobat reader
This interesting idea for an evaluation function for a computer chess program is worth reading if you enjoy looking
at new ideas in the field of computer chess.
Abstract:
How might we create an evaluation function for a computer chess program that plays a stronger positional game of chess?
A new heuristic for estimating the positional pressure produced by chess pieces is proposed. We construct an evaluation from
a Systems perspective, using a dynamic model of the interaction of the pieces. The identification and management of stressors
and the construction of resilient positions allow effective cut-offs for less-promising game continuations due to the presence
of adaptive capacity. We calculate and maintain a database of potential mobility for each chess piece 3 moves into the future,
for each position we evaluate in our search tree. We determine the likely restrictions placed on the future mobility of the
pieces based on the attack paths of the lower-valued enemy pieces. Initial results are presented.
keywords: complexity, chess, game theory, constraints, heuristics, planning, measurement, diagnostic test, resilience
Read more about Stress and Coping
Read more about Resilience
Read more about Systems Thinking
Wikipedia article on Theory of Constraints
Read more about the Theory of Constraints
Additional Quotations
An older version of this paper
|