Binary 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.
≈ 2 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 x0,x1,x2,.... Player I wins the game if and onl if the binary number (x0.x1x2x3...)2∈X, that is, Σn=0∞xn2n∈X. See,[1] page 237.
The binary game is sometimes called Ulam's game, but "Ulam's game" usually refers to the Rényi–Ulam game.
References
edit edit source- ^ Telgársky, Rastislav (Spring 1987). "Topological Games: On the 50th Anniversary of the Banach-Mazur Game". Rocky Mountain Journal of Mathematics. 17 (2): 227–276.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1379012829 under CC BY-SA 4.0; modifications have been made.