A Computer Chess Marathon

Dennett imagines a deterministic chess tournament in which varied games reveal the programs' competences. The case asks why determinism would erase meaningful differences in ability, choices, or opportunities; it is not primarily a contrast between human intuition and computer brute force.

A deterministic system can display a repeatable capability across varied situations. Replaying precisely one game establishes only what happens in that game; allowing a deterministic sequence to generate different games can reveal broader strengths. The explanation of an advantage may concern search, evaluation, or speed even though every event has sufficient causes.

The practical lesson is to distinguish an exact replay from a test of what a system can do under relevant variations. This also clarifies a philosophical disagreement: defining ability only by a physically identical past can conceal the ordinary counterfactual comparisons used to assess skills. The thought experiment supports an argument, not a proof that every disputed account of freedom is false.

When to use it

Use when determinism is confused with lack of capability, when comparing reproducible systems, or when clarifying counterfactual claims about what an agent can do.

How it can help

Separate exact replay from performance across relevant variations. Explain reliable advantages through decision procedures, information, and resources rather than treating determinism as a complete explanation.