ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HxH_x be the entropy of a position for an optimal search heuristic in chess, and let LL be an optimally compressed endgame tablebase capable of returning the perfect result for any legal and reachable position.

Entropy–tablebase bound. The relation

Hx≤L≤Hx+1H_x \leq L \leq H_x + 1

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.