Zermelo's theorem
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.
Proper noun
Zermelo's theorem
- 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.
- The well-ordering theorem.
Origin of Zermelo's theorem
Named after Ernst Zermelo.
Questions about Zermelo's theorem
- What does Zermelo's theorem mean?
- Zermelo's theorem means 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.
- What part of speech is Zermelo's theorem?
- Zermelo's theorem is a proper noun.
Words near Zermelo's theorem in the dictionary
Source and license
Adapted from Wiktionary: Zermelo's theorem (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “Zermelo's theorem.” Word.ws, https://word.ws/zermelo%27s_theorem. Based on Wiktionary, CC BY-SA 4.0.
