Author: Bob Durrett
Date: 17:31:41 12/05/02
Go up one level in this thread
Imagine the following experiment: Several very strong chess players, preferably GMs, are put in a room and given the task of categorizing a very large set of chess positions. Assume also that they are willing participants. There is one large box filled with a large number of slips of paper. Each slip will have a single chess position on it. No two slips of paper have the same position. To obtain the positions on those slips of paper, a large number of positions were previously selected, using some *completely* random process, from a large database of high quality games. Being completely random, this process should have produced roughly equal numbers of opening, middlegame, and endgame positions. There are three large empty boxes, open at the top. One box is labeled "tactical." Another box is labeled "positional." The third box is labeled "no consensus reached within allotted time." The GMs are to try to reach a consensus. [No fair cheating!] They have a reasonable amount of time to examine each position. All positions for which consensus is not reached go in the box labeled "no consensus reached within allotted time." Otherwise, if the consensus is that the position is "tactical," the slip of paper goes into the box labeled "tactical." Finally, if consensus is reached that a position is "positional," it goes into the box labeled "positional." Would it not then reasonable to DEFINE positions in the "tactical" box to be "tactical" and the positions in the "positional" box to be "positional"? I believe that would be reasonable. I expect that, when all the slips had been examined, there would then be quite a few slips in the "no consensus reached within allotted time" box. My expectation is based on my perception that there are many positions that are, at the same time, both "tactical" and "positional," or maybe halfway in between. What does this have to do with computer chess? A second experiment could then be performed. Each position in the "tactical" box would be examined, this time, not by HUMANs but by the top chess engines. The purpose of the experiment would be to find tactical positions that presented problems for the chess engines, requiring too much time for evaluation. The same could be done for the positional and indeterminate positions. What would be the findings of this experiment? If modern chess engines are good at evaluating tactical positions, then there may be only a very few tactical positions found to be difficult for chess computers. If chess engines are poor at evaluating positional positions, then there may turn out to be a large number of positions found to be difficult for chess computers. And what about the positions taken from the "no consensus reached within allotted time" box? Your guess is as good as mine. Now, here is a test: [You have five seconds to answer.] What are the definitions of tactical and positional positions? [Tick, tick, tick.] Bob D.
This page took 0.01 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.