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¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:d0e2413b39ed · see in the full table