Ernst Zermelo

From Chessprogramming wiki
Revision as of 22:10, 1 October 2018 by GerdIsenberg (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Home * People * Ernst Zermelo

Ernst Friedrich Ferdinand Zermelo, (July 27, 1871 – May 21, 1953)
Ernst Zermelo [1]

a German mathematician and pioneer in set- and game theory. His university bibliography includes the Humboldt University of Berlin 1894, the University of Göttingen 1899, honorary professorship in Zürich 1910, and the University of Freiburg since 1926. During the Third Reich, in 1935 disciplinary actions were initiated against him, because he refused the Hitler salute. To preempt of his dismissal, as a result he withdrew voluntarily. In 1946 he was reinstated in Freiburg [2].

Set Theory

In 1900, Zermelo proved the well-ordering theorem, which states that every set can be well ordered. This gave rise to the Zermelo axiom that every class can be well ordered. In 1904 Zermelo defined the axiom of choice [3], the use of which had previously been unrecognized in mathematical reasoning. The first formulations of axioms for set theory - an axiom system for German mathematician Georg Cantor's theory of sets [4] - were made by Zermelo in 1908.

Game Theory

In 1912, Zermelo proved the determinism of games like chess and that rational players were able to utilize all information to develop an optimal strategy [5]. Zermelo's theorem is the mathematical justification for the retrograde analysis chess algorithm [6] [7].

Tournament Results

Zermelo published a paper about "The calculation of the tournament results as a maximum problem of the probability calculus" in 1929 [8] .

See also


External Links

Yale Course by Ben Polak, covers Zermelo's theorem


  1. Image from Zermelo Portraits from MacTutor History of Mathematics created by John J O'Connor and Edmund F. Robertson
  2. Seminar für überfachliche Grundlagen: Mathematiker in der NS-Zeit (German) Zermelo refuses Hitler salute
  3. Ernst Zermelo (1904). Beweis, daß jede Menge wohlgeordnet werden kann. Mathematische Annalen 59: 514–16 (German)
  4. Controversy over Cantor's theory from Wikipedia
  5. Ernst Zermelo (1913). Über eine Anwendung der Mengenlehre auf die Theorie des Schachspiels. Proc. Fifth Congress Mathematicians, Cambridge University Press 1913, 501–504. Translation: On an Application of Set Theory to the Theory of the Game of Chess.
  6. Edward Komissarchik, Aaron L. Futer (1974). Ob Analize Ferzevogo Endshpilya pri Pomoshchi EVM. (Analysis of a queen endgame using an IBM computer) Problemy Kybernetiki, Vol. 29, pp. 211-220. English translation by Christian Posthoff, revised as Edward Komissarchik, Aaron L. Futer (1986). Computer Analysis of a Queen Endgame. ICCA Journal, Vol. 9, No. 4
  7. Lewis Stiller (1995). Exploiting symmetry on parallel architectures. Ph.D. Thesis
  8. Ernst Zermelo (1929). Die Berechnung der Turnier-Ergebnisse als ein Maximumproblem der Wahrscheinlichkeitsrechnung. pdf (German)
  9. see Appendix in Ulrich Schwalbe, Paul Walker (1997). Zermelo and the early history of game theory. pdf
  10. Artikel zur Vorlesung "Spieltheorie" (German)

What links here?

Up one level