The entropy bound for optimally compressed chess endgame tablebases
Statement
Let be the entropy of a position for an optimal search heuristic in chess, and let be an optimally compressed endgame tablebase capable of returning the perfect result for any legal and reachable position.
Entropy–tablebase bound. The relation
holds. This connects the entropy of chess positions under optimal search with the space required to encode perfect endgame decisions; the source provides no evidence that the bound has been proved or disproved.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.