Programming a Computer for Playing Chess.¶
Shannon, C. E. (1950). Programming a Computer for Playing Chess. Philosophical Magazine, 41(314), 256-275.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Decidability Computability
- "From this position, can White force a win?" is decidable but intractable: the game tree is finite, so exhaustive minimax search terminates with the correct answer — a uniform procedure exists — yet the tree is astronomically large, so the procedure is correct in principle and infeasible in practice.
This sourceFrames chess as a finite, in-principle-decidable game tree whose exhaustive solution is astronomically intractable — the decidable-but-intractable case.
- "From this position, can White force a win?" is decidable but intractable: the game tree is finite, so exhaustive minimax search terminates with the correct answer — a uniform procedure exists — yet the tree is astronomically large, so the procedure is correct in principle and infeasible in practice.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:d0e2413b39ed · see in the full table