Zermelo's theorem

既定 英語（イギリス） (en-GB)

固有名詞

(game theory) 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.

日本語の意味

(ゲーム理論) 有限の手数で完璧な情報が与えられる二人零和ゲームにおいて、プレイヤーが交互に手を打ち、偶然の要素が意思決定に影響しない状況で、もし引き分けが存在しなければ、どちらかのプレイヤーが必ず勝利を強制できる戦略を持つという定理。

このボタンはなに？

Zermelo's theorem implies that in finite two-player games of perfect information where draws are impossible, one player must have a winning strategy.

ツェルメロの定理は、有限の完全情報二人ゲームで引き分けがありえない場合、どちらか一方のプレイヤーが必勝戦略を持つことを示している。

詳細

意味（1）

(game theory) 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.

意味（2）

(set theory) The well-ordering theorem.