About this question
Medium · Game Theory & Logic · Quant Trader interview question · game-theory, determinacy, logic, strategy
Consider a finite two-player game of perfect information (like Chess or Checkers) where players alternate moves and there is no element of chance (no dice rolls, card draws, etc.). The game must end after a finite number of moves, with one player winning, the other losing, or a draw occurring. Which of the following statements best describes Zermelo's Theorem regarding such games?