WRSWorld Research StateContribute
WORLD RESEARCH STATE

Shannon: search and evaluation for computer chess

Contribution grade

Game-playing algorithms · Game-playing algorithms

Reference score100,000Provisional editorial estimate of this exact contribution; its grade is assessed separately.

What changed

Move-generation routines, position evaluation and fixed-depth versus selective continuations make limited-computation game search an explicit programming design.

Scientific scope

Move-generation routines, position evaluation and fixed-depth versus selective continuations make limited-computation game search an explicit programming design. The paper is a programming and search proposal. It does not report a strong implemented player, solve chess or guarantee that heuristic evaluation and selective search select the best move.

Evidence

Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.

Contributors

Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.

Full scientific record · Browse contribution grades · Request a correction