Summary
Weakly solved means that for the initial position a strategy has been determined
to achieve the game-theoretic value against any opposition. [1]
The game-theoretic value of a game is the outcome when all participants play optimally.[1]
Optimal play is play without errors.
An error (?) is a move that changes a game from drawn to lost, or from won to drawn.[2]
A blunder or double error (??) changes a game from won to lost.
A strategy can be moves like Checkers,[3] or rules like Connect Four,[4] or a combination.
It is beneficial to incorporate knowledge into game solving programs.[1]
Chess knowledge can be acquired from the Laws of Chess only. [5]
The objective of Chess is to checkmate the opponent.[6]
A direct attack on the king can succeed only if the opponent does not play optimally.
Queening a pawn is more feasible to achieve checkmate.
We know from gambits that 3 tempi in the initial position are worth 1 pawn.[7]
1 tempo in the initial position is not enough to win: a pawn can queen, a tempo not.
Millions of human & engine games confirm that Chess is a draw.
In the last 10 ICCF world championship finals: 1469 games = 1177 draws + 292 decisive.[8]
Of the 1177 draws 1140 are perfect games with optimal play from both sides.
Starting from the 10^44 legal positions [9] none of the 56011 legal positions in a sample of 1 million can result from optimal play by both sides. Gourion’s 10^37 [10] is a better estimate, but In a sample of 10000 [11] none can result from optimal play either. That leaves 10^37 / 10000 = 10^33 positions. Multiply by 10 to include positions with 3 or 4 queens: 10^33 * 10 = 10^34.
Weakly solving Chess calls for a strategy, i.e. one strategy only.[1]
On w white moves not w black responses each, but 1 black response only.
w * 1 = Sqrt (w * w)
Thus Sqrt (10^34) = 10^17 positions relevant to weakly solving Chess.
Checkers has been weakly solved with 10^14 positions [3] and Losing Chess with 10^9 positions.[12] Checkers has been solved with 19 of the 300 openings: 200 transpositions and 81 pruned.
Cloud engines calculate a billion nodes / s.[13] Thus 3 such engines calculate in 5 years:
10^9 nodes / s / engine * 3 engines * 3600 s / h * 24 h / d * 365.25 d / a * 5 a = 4.4 * 10^17 nodes
A diagram is the location of the men on the board.
A position is a diagram + side to move + castling rights + en passant flag.[6]
A node is a position + evaluation + history.[13]
Thus 3 engines exhaust in 5 years all 10^17 relevant positions and weakly solve Chess.
Chess can be weakly solved in 5 years, but needs 3 million $ to hire 3 grandmasters and rent 3 engines.
'Give me five years, good assistants and the latest computers
- I will bring all openings to technical endgames and "close" chess.' - GM Sveshnikov [14]
References:
[1] Van den Herik https://www.sciencedirect.com/science/article/pii/S0004370201001527
[2] Hübner, Twenty-five Annotated Games, Berlin, 1996, pp. 7–8.
[3] Schaeffer https://www.science.org/doi/10.1126/science.1144079
[4] Allis http://www.informatik.uni-trier.de/~fernau/DSL0607/Masterthesis-Viergewinnt.pdf
[5] McGrath et. al. https://arxiv.org/pdf/2111.09259.pdf
[6] FIDE Laws of Chess https://handbook.fide.com/chapter/E012018
[7] Capablanca A Primer of Chess https://archive.org/details/aprimerofchess/page/n47/mode/2up
[8] ICCF WC Finals https://www.iccf.com/tables
[9] Tromp Ranking of Chess positions https://github.com/tromp/ChessPositionRanking
[10] Gourion https://arxiv.org/pdf/2112.09386.pdf
[11] Tromp https://github.com/tromp/ChessPositionRanking/blob/noproms/sortedRnd10kFENs
[12] Watkins https://magma.maths.usyd.edu.au/~watkins/LOSING_CHESS/LCsolved.pdf
[13] NPS - What are the "Nodes per Second" in Chess Engine Analysis
https://chessify.me/blog/nps-what-are-the-nodes-per-second-in-chess-engine-analysis
[14] Sveshnikov https://e3e5.com/article.php?id=1467
Yes, I favour Putin being captured rather than merely checkmated. And then melted down and turned into something useful.
ladies' purses?