copyright (c) 2009 John L. Jerz

Znosko-Borovsky analyzes Lasker-Capablanca, St. Petersburg, 1914

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
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
Aron Katsenelinboigen
Favorite Links
Jan Timmerman
About Me
Additional Notes
The Case for Using Probabilistic Knowledge in a Computer Chess Program (John L. Jerz)
Resilience in Man and Machine

Lasker-Capablanca, St. Petersburg, 1914
tn_ZBa.jpg
White to move, after 10...Re8

Znosko-Borovsky, in The Middle Game in Chess, p. 105, claims that in the above position White has the advantage in space.
"with two centre-pawns in the fourth rank and two well-developed knights. Black's forces occupy the first three ranks, with little hope of enlarging their scope."
 
Znosko-Borovsky claims that 11.Nb3 is best for white.
"The explanation is that, with an advantage in space, it is less important to threaten the enemy than to prevent him from extricating himself from his cramped position and to deny him the possibility of making any threats himself."
 
Znosko-Borovsky analyzes the sequence 11.Nb3 f6 12.f5 b6 13.Bf4 Bb7 14.BxB pxB 15.Nd4 etc. and shows how white can gradually build positional pressure.
 
However, a computer program evaluates the diagrammed position as follows: (24-ply)
 
Analysis by Rybka 2.3.2a mp :
 
1.  (-0.21): 11.Nf3 Bc5+ 12.Kh1 f5 13.e5 Be6 14.Re1 Rad8 15.Be3 Bb4 16.Bd2 c5 17.a3 Bxc3

2.  (-0.26): 11.e5 Bc5 12.Be3 f6 13.exf6 Nd5 14.Nxd5 cxd5 15.Bf2 gxf6 16.Nb3 Bf8 17.Rfd1 Bf5

3.  (-0.27): 11.Kf2 f6 12.Nf3 b5 13.a3 a5 14.Rd1 Ng6 15.f5 Nf8 16.Re1 Nd7 17.g3 Bb7

4.  (-0.29): 11.Nb3 a5* 12.a4 Ng6 13.Be3 Bb4 14.Nd2 f6 15.Kf2 b6 16.Rfe1 Bb7 17.Na2 Bxd2

5.  (-0.31): 11.h3 f6 12.a3 c5 13.Nb3 Nc6 14.Be3 b6 15.Rad1 Be6 16.Kf2 Bxb3 17.cxb3 Rab8
 
The numbers indicate that the machine thinks that the position is more promising for black. How can this this be?
 
It seems that Znosko-Borovsky's elements of chess (position, time, space, force) only indicate whether or not a position is 'promising' - you would have to perform a deep and thorough search through the promising variations (including a minimal amount of search through the initially unpromising but 'interesting' lines such as sacrifices) to better estimate winning chances.
 
*At this point we have: (26-ply)
 
1. (-0.27):  12.a4 Ng6 13.g3 Bb4 14.Bd2 f6 15.Kf2 b6 16.Rfe1 Be6 17.Na2 Bd6 18.Nac1 Rad8 

Enter supporting content here