1.6Mb download - pdf version |
|
31 December, 2013 - A Proposed Heuristic For a Computer Chess Program / Final Internet Version |
click here to download file
Proposed Heuristic Archive
This is the final Internet version. A self-published work will appear in 2015.
Abstract
How might we manage the attention of a computer chess program in order to play a stronger positional game of chess? A new heuristic is proposed, based in part on the Weick organizing model. We evaluate the 'health' of a game position 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 postponements for less-promising game continuations due to the perceived presence of adaptive capacity and sustainable development. We calculate and maintain a database of potential mobility for each chess piece 3 moves into the future, for each position we evaluate. We determine the likely restrictions placed on the future mobility of the pieces based on the attack paths of the lower-valued enemy pieces. Knowledge is derived from Foucault's and Znosko-Borovsky's conceptions of dynamic power relations. We develop coherent strategic scenarios based on guidance obtained from the vital Vickers/Bossel/Max-Neef diagnostic indicators. Archer's pragmatic 'internal conversation' provides the mechanism for our artificially intelligent thought process. Initial but incomplete results are presented.
Read more about Stress and Coping
Read more about Resilience
Wikipedia article on Theory of Constraints
Read more about the Theory of Constraints
Additional Quotations
An older version of this paper |