On Zermelo's theorem

Abstract

A famous result in game theory known as Zermelo's theorem says that ''in chess either White can force a win, or Black can force a win, or both sides can force at least a draw. The present paper extends this result to the class of all finite-stage two-player games of complete information with alternating moves. It is shown that in any such game either the first player has a winning strategy, or the second player has a winning strategy, or both have unbeatable strategies.