combinatorial game

  • 41Zugzwang — For the musical work written by Juan Maria Solare, see Zugzwang (musical work). Not to be confused with zwischenzug. Zugzwang (German for compulsion to move , pronounced [ˈtsuːktsvaŋ]) is a term usually used in chess which also applies to various …

    Wikipedia

  • 42Sprague–Grundy theorem — In combinatorial game theory, the Sprague–Grundy theorem states that every impartial game under the normal play convention is equivalent to a nimber. The Grundy value or nim value of an impartial game is then defined as the unique nimber that the …

    Wikipedia

  • 43Domineering — You may also be searching for Domination. This article is about the partisan game of Domineering. For the impartial version of the game, see Cram (games). Domineering (also called Stop Gate or Crosscram) is a mathematical game played on a sheet… …

    Wikipedia

  • 44Michael H. Albert — This article is about the computer scientist. For the economist, see Michael Albert. Michael Henry Albert (born September 20, 1962) is a mathematician and computer scientist, originally from Canada, and currently an associate professor at the… …

    Wikipedia

  • 45Surreal number — In mathematics, the surreal number system is an arithmetic continuum containing the real numbers as well as infinite and infinitesimal numbers, respectively larger or smaller in absolute value than any positive real number. The surreals share… …

    Wikipedia

  • 46Misère — Misere or misère (French for destitution ; equivalent terms in other languages include bettel, contrabola, devole, null, pobre) is a bid in various card games, and the player who bids misere undertakes to win no tricks or as few as possible,… …

    Wikipedia

  • 47Hackenbush — is a two player mathematical game which may be played on any configuration of colored line segments connected to one another by their endpoints and to the ground. More precisely, there is a ground (conventionally, but not necessarily, a… …

    Wikipedia

  • 48Nim — For other uses, see Nim (disambiguation). Nim is a mathematical game of strategy in which two players take turns removing objects from distinct heaps. On each turn, a player must remove at least one object, and may remove any number of objects… …

    Wikipedia

  • 49Elwyn Berlekamp — Infobox Scientist name = Elwyn R Berlekamp |185px image width = 125px birth date = Birth date and age|1940|9|6 death date = residence = USA alma mater = MIT field = Information theory, Coding theory, Combinatorial game theory known for =… …

    Wikipedia

  • 50Map-coloring games — Several map coloring games are studied in combinatorial game theory. The general idea is that we are given a map with regions drawn in but with not all the regions colored. Two players, Left and Right, take turns coloring in one uncolored region… …

    Wikipedia