Zermelo's theorem

proper noun

A theorem about finite two-person games of perfect information in which the players move alternately and chance does not affect the decision-making process. It states that if the game cannot end in a draw, then one of the two players must have a winning strategy, i.e. force a win.

Ask AI about this wordChatGPTClaudePerplexityGoogle AIGrok

Meanings

proper noun
  1. computingA theorem about finite two-person games of perfect information in which the players move alternately and chance does not affect the decision-making process. It states that if the game cannot end in a draw, then one of the two players must have a winning strategy, i.e. force a win.
  2. mathematicsThe well-ordering theorem.

Origin

Named after Ernst Zermelo.

Full word history & related roots →
Cite this entry
APA

Zermelo's theorem. (n.d.). In WatkinsX Dictionary. Retrieved November 4, 2026, from https://dictionary.watkinsx.com/word/Zermelo's%20theorem

MLA

“Zermelo's theorem.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Zermelo's%20theorem. Accessed November 4, 2026.

Chicago

WatkinsX Dictionary, s.v. “Zermelo's theorem,” accessed November 4, 2026, https://dictionary.watkinsx.com/word/Zermelo's%20theorem.

Source: Zermelo's theorem on Wiktionary, CC BY-SA 4.0.