Binary game
≈ 3 min read
Names in other languages
- EnglishBinary game
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In mathematics, the binary game is a topological game introduced by Stanisław Ulam in 1935 in an addendum to problem 43 of the Scottish book as a variation of the Banach–Mazur game. In the binary game, one is given a fixed subset X of the set {0,1} N of all sequences of 0s and 1s. The players take it in turn to choose a digit 0 or 1, and the first player wins if the sequence they form lies in the set X. Another way to represent this game is to pick a subset X of the interval [0,2] on the real line, then the players alternatively choose binary digits x_0, x_1, x_2, ... .
Player I wins the game if and onl if the binary number (x_0{}.x_1{}x_2{}x_3{}...)_2 \in{}X , that is, \Sigma^{\infty}_{n=0}\frac{x_n}{2^n}\in{}X . See, page 237. The binary game is sometimes called Ulam's game, but "Ulam's game" usually refers to the Rényi–Ulam game.
In mathematics, the binary game is a topological game introduced by Stanisław Ulam in 1935 in an addendum to problem 43 of the Scottish book as a variation of the Banach–Mazur game. In the binary game, one is given a fixed subset X of the set {0,1} N of all sequences of 0s and 1s. The players take it in turn to choose a digit 0 or 1, and the first player wins if the sequence they form lies in the set X. Another way to represent this game is to pick a subset X of the interval [0,2] on the real line, then the players alternatively choose binary digits x_0, x_1, x_2, ... .
Player I wins the game if and onl if the binary number (x_0{}.x_1{}x_2{}x_3{}...)_2 \in{}X , that is, \Sigma^{\infty}_{n=0}\frac{x_n}{2^n}\in{}X . See, page 237. The binary game is sometimes called Ulam's game, but "Ulam's game" usually refers to the Rényi–Ulam game.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1379012829 under CC BY-SA 4.0; modifications have been made.