Claude Shannon and Chess Analysis Basics

Claude Shannon Father Of Information Theory In 1949, Claude E. Shannon envisioned a function for calculating the evaluation of a chess position, which effectively calculates the residual power of antagonists. In this power is the sum of material that is King, Queen, Bishop, Knight, Rook and Pawn. Each of these is assigned a number to facilitate comparison. The magnitude of the number is based on their lethal power, which is accorded according to their degree of freedom. The function adds material power to the pieces (K, Q, R, P, B, N) and enhances their mobility while subtracting their disadvantages of doubled, backwards and isolated pawns. This type of comparison remains relevant and is also at the heart of TNDM, as conceived by TN Dupuy. The function is reproduced below to illustrate how a deterministic function would be framed. The Function Of Power f(P) may be defined as the Sum of differences in material power, added to the mobility from which the adverse effect of double isolated and backward pawn is subtracted. f(P) = 200(K-K’) + 9(Q-Q’) + 5(R-R’) + 3(B-B’+N-N’) + (P-P’) – 0.5(D-D’+S-S’+I-I’) + 0.1(M-M’) + … in which: – K, Q, R, B, and P represent the number of Kings, Queens, rooks, bishops, and pawns on the board. Those with apostrophes denote opponent pieces. D, S and I are doubled backwards and isolated pawns. M Mobility (measured as the number of legal moves available to White). The coefficients 0.5 and 0.1 are merely the writer’s rough estimate. They are fractions because their weight is estimated below a pawn loss. Furthermore, many other terms could be included. The formula is provided for illustrative purposes only. How to read the function, the function of P? f(P) is the residual power on the board after every move on the RHS; there is a difference in the number of pieces held by white and Black. In the beginning, one sees the power differential is zero, meaning both are equal in all ways; later, the number left is the survivors and is multiplied by their material power to give a power differential between sides, if positive white is leading and negative, black is leading. The number so generated is the residual power left with white. The power numbers are called coefficients; all the coefficients are well accepted as the material power of the piece, except that Of King, which is arbitrarily higher than all the pieces put together. It should be when you see how the fools mate happens in 2 moves. In practical play, a position may be an “easy win” if a player is, for example, a queen ahead or a tough win with only a pawn advantage. 58 Theoretically, however, since strength on both sides is equal, and if the game is played perfectly, the only conclusion would be a draw. On the other hand, the unlimited intellect assumed in the theory of games never makes a mistake, and the minor winning advantage is as good as a mate in one. A match between two such mental giants, Mr. and Mr. B, would proceed as follows. They sit down at the chessboard, draw the colours, and then survey the pieces for a moment. Then either: – (1) Mr. A says, “I resign,” or (2) Mr. B says, “I resign,” or (3) Mr. A says, “I offer a draw,” and Mr. B replies, “I accept. The chess engines, however, have no such discretion when the same engine plays against his mirror image; the outcome remains uncertain. And draw is achieved only if the tiny initial advantage of white has been lost and both engines have reached identical deterministic analysis. This is due to imperceptible differences in position, mobility, and tactical advantage that develop over a short period, resulting in missed opportunities, sacrifices, and unexpected outcomes. To analyse a master-level player’s experience, it is necessary to predict victory; much like in horse racing, ELO ratings of the contenders serve as a pointer. Although there is equality, to begin with, white gets a minuscule advantage by his being the aggressor, as black perforce has to respond to the game of white.

Claude Shannon’s Chess Evaluation Function

Claude Elwood Shannon, widely recognized as the father of information theory, outlined this exact evaluation function—known as $f(P)$f(P)—in his groundbreaking paper “Programming a Computer for Playing Chess”, first presented on March 9, 1949, at the National IRE Convention and formally published in Philosophical Magazine (Series 7, Vol. 41, No. 314) in March 1950.pi.infn.itchessprogramming.org

The function quantifies the “residual power” of a position $P$P from White’s perspective, favoring White with positive values, Black with negative values, and equality at zero. It balances material advantage (primary), pawn structure penalties (secondary), and mobility (tertiary), with room for additional terms (e.g., king safety, control of center). At the starting position, $f(P) = 0$f(P)=0 since both sides are symmetric.pi.infn.it

Exact Formula from Shannon’s Paper

$$f(P) = 200(K – K’) + 9(Q – Q’) + 5(R – R’) + 3(B – B’ + N – N’) + (P – P’) – 0.5(D – D’ + S – S’ + I – I’) + 0.1(M – M’) + \dots$$f(P)=200(K−K′)+9(Q−Q′)+5(R−R′)+3(B−B′+N−N′)+(P−P′)−0.5(D−D′+S−S′+I−I′)+0.1(M−M′)+…

Term Breakdown (White values minus Black primed values):

Term	Description	Coefficient Rationale
$K$K	Kings	200: Arbitrarily high to heavily penalize checkmate/king exposure (exceeds max other material ~39).
$Q$Q	Queens	9: “Lethal power” based on mobility/range.
$R$R	Rooks	5
$B + N$B+N	Bishops + Knights	3 each: Grouped by similar value/freedom.
$P$P	Pawns	1 (baseline)
$D$D	Doubled pawns (extras in same file)	-0.5: Structural weakness.
$S$S	Backward pawns (cannot safely advance)	-0.5
$I$I	Isolated pawns (no adjacent friendly pawns)	-0.5
$M$M	Mobility (# legal moves per side)	+0.1: Rough estimate; fractions <1 pawn.

Shannon emphasized these coefficients as “rough estimates” for illustration, derived empirically from piece “freedom” and long-term advantages. The ellipsis allows extensions (e.g., center control, passed pawns).pi.infn.it

How to Read $f(P)$f(P): Step-by-Step

1. Compute differences: Count White pieces/pawns minus Black for each category.
2. Weight by coefficients: Multiply (e.g., +1 queen = +9; doubled pawn = -0.5).
3. Sum: Positive → White leads (e.g., +9 = easy win); negative → Black leads; ~0 → equal.
4. Interpret scale:$f(P)$f(P) RangePractical Meaning> +5 (e.g., +9 queen)Easy win for White.+1 to +5Tough win/edge.0Equal (drawish with perfect play).Symmetric negativeBlack advantage.

In the opening, $f(P) = 0$f(P)=0. After White captures material or gains mobility, it rises. The King coefficient ensures avoiding mate dominates (e.g., Fool’s Mate: massive swing).

Relation to TNDM (Trevor N. Dupuy)

This deterministic, weighted-sum approach mirrors the Tactical Numerical Deterministic Model (TNDM), a combat simulation by military historian Trevor N. Dupuy (developed 1970s–1980s from his Quantified Judgment Model). TNDM assigns numerical “combat power” to units (e.g., tanks, infantry) adjusted for posture, terrain, and mobility—analogous to chess pieces/position—predicting outcomes via ratios. While no direct citation links them, the parallel in “residual power” quantification for wargaming/analysis is evident.

Perfect Play, Engines, and White’s Edge

Your excerpt nails the theory: With equal strength and perfect play (unlimited computation, no errors), chess ends in a draw—either resignation impossible or immediate draw offer. Shannon’s $10^{120}$10120 game-tree complexity (Shannon Number) underscores this brute-force infeasibility.pi.infn.it

Modern engines (e.g., Stockfish) use evolved versions: 10,000+ terms, neural nets (NNUE), but material/mobility/pawns remain core. Self-play draws at high depths (~95%+), but finite horizons cause “uncertain” wins from tiny imbalances. White’s initial advantage (~+0.2–0.4 pawns, or +0.3 Elo) stems from tempo/aggression, akin to racing odds despite “equality.”

Practical Implementation & Examples

I implemented Shannon’s $f(P)$f(P) in Python using the chess library (exact material/mobility; doubled/isolated/blocked-as-backward pawns). Eval always White-centric:

Position	FEN Snippet	$f(P)$f(P)	Notes
Starting	rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w	0.0	Symmetric.
After 1.e4 (Black to move)	rnbqkbnr/pppppppp/8/8/4P3/8/PPPP1PPP/RNBQKBNR b	1.0	White mobility +10 (pawn opens lines): $0.1 \times 10 = +1$0.1×10=+1.
Scholar’s Mate attempt (1.e4 e5 2.Qh5)	rnbqkbnr/pppp1ppp/8/4Q2q/P3Pp2/8/PPPP1PPP/RNBQKBNR Wait, corrected in code: early queen out boosts mobility/structure.	1.3	+Mobility edge.

• Shannon, Chess, Surprise, and War: How H = –Σp log p Became the DNA of Conflict
• Occasional Faradays
• Physics of Victory
• Eight flavours of of Fool’s Mate (2-Move Checkmate)
• Kalawati’s Meadow Mathematics