Copyright (c) 2013 John L. Jerz

A Proposed Heuristic for a Computer Chess Program (John L. Jerz)

Home
A Proposed Heuristic for a Computer Chess Program (John L. Jerz)
Problem Solving and the Gathering of Diagnostic Information (John L. Jerz)
A Concept of Strategy (John L. Jerz)
Books/Articles I am Reading
Quotes from References of Interest
Satire/ Play
Viva La Vida
Quotes on Thinking
Quotes on Planning
Quotes on Strategy
Quotes Concerning Problem Solving
Computer Chess
Chess Analysis
Early Computers/ New Computers
Problem Solving/ Creativity
Game Theory
Favorite Links
About Me
Additional Notes
The Case for Using Probabilistic Knowledge in a Computer Chess Program (John L. Jerz)
Resilience in Man and Machine

Advance to Next Chapter: Chapter 2 - An Explanation of the Proposed Heuristic

 
The initial efforts of this paper were focused on attempting to explain how the Rybka chess program works, but that is not the current focus. There has been some very limited interest in the initial efforts to introduce these ideas to the computer chess community. Copyright (c) 2007 by John L. Jerz November 2, 2007

1. Introduction

Nothing is more difficult than the art of maneuvering for advantageous positions.
    Sun-Tzu (~400 BC)

The purpose of computing is insight, not numbers.
 R. W. Hamming
 
If we could first know where we are, and whither we are tending, we could better judge what to do, and how to do it.
- Abraham Lincoln, US president

In the big picture, whether the [chess] computer beats us isn't important. Either way, it's a human triumph. In fact, it's a greater human triumph when the computer wins. As a player, you can conceive a brilliant move without understanding where it came from. As a programmer, you have to do something much harder: articulate rules that will generate such brilliance. - "We've Made Our Match", William Saletan, Sunday, May 13, 2007; Page B02 Washington Post

The challenge: How might we create an evaluation function for a computer chess program that plays a stronger positional game of chess? Solutions should ideally have utility for both real-time game playing and for analysis of completed games.

This article is concerned with the problem of constructing a computing routine or "program" for a modern general purpose computer which will enable it to play chess.

Specifically, this article is concerned with heuristic algorithms. A heuristic is anything that provides a plausible aid or direction in the solution of a problem but is in the final analysis unjustified, incapable of justification, and potentially fallible [from Koen, Discussion of the Method, p.28]. Heuristics help solve unsolvable problems or reduce the time needed to find a satisfactory solution.

From wikipedia: Aron Katsenelinboigen has discussed the positional style of playing a chess game.

The positional style is distinguished by


1. a positional goal and
2. a formation of semi-complete linkages between the initial step and final outcome. Katsenelinboigen declares

“Unlike the combinational player, the positional player is occupied, first and foremost, with the elaboration of the position that will allow him to develop in the unknown future. In playing the positional style, the player must evaluate relational and material parameters as independent variables. ( … ) The positional style gives the player the opportunity to develop a position until it becomes pregnant with a combination. However, the combination is not the final goal of the positional player—it helps him to achieve the desirable, keeping in mind a predisposition for the future development. The Pyrrhic victory is the best example of one’s inability to think positionally.”[8]

The positional style serves to

a) create a predisposition to the future development of the position;
b) induce the environment in a certain way;
c) absorb an unexpected outcome in one’s favor;
d) avoid the negative aspects of unexpected outcomes.


The positional style gives the player the opportunity to develop a position until it becomes pregnant with a combination. Katsenelinboigen writes:
“As the game progressed and defense became more sophisticated the combinational style of play declined. . . . The positional style of chess does not eliminate the combinational one with its attempt to see the entire program of action in advance. The positional style merely prepares the transformation to a combination when the latter becomes feasible.”[9]

 

[8] V. Ulea, The Concept of Dramatic Genre and The Comedy of A New Type. Chess, Literature, and Film. Southern Illinois University Press, 2002, p.p.17-18])
[9] Selected Topics in Indeterministic Systems Intersystems Publications: California, 1989, p. 21


 

Continue to next section

Next Chapter: Chapter 2 - An Explanation of the Proposed Heuristic

Enter supporting content here