Metraipolis › archive › dc_6b7e7b8908fd

Tiny and miny — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Tiny_and_miny
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-31T14:36:07.202Z
SHA-256 of the archived text
a1a2f86a69e19036e49b7b80ba41f94b7eba57b60eecc0e0fc7bef6d2eed8ff6
Stable URL of this page
https://metraipolis.com/documento/dc_6b7e7b8908fd

How to cite

Tiny and miny — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Tiny_and_miny (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_6b7e7b8908fd (Metraipolis archive dc_6b7e7b8908fd, sha256 a1a2f86a69e19036e49b7b80ba41f94b7eba57b60eecc0e0fc7bef6d2eed8ff6)
BibTeX
@misc{dc6b7e7b8908fd,
  title = {Tiny and miny — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Tiny_and_miny},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_6b7e7b8908fd; sha256 a1a2f86a69e19036e49b7b80ba41f94b7eba57b60eecc0e0fc7bef6d2eed8ff6},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Tiny_and_miny. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In combinatorial game theory, a branch of mathematics studying two-player games of perfect information in extensive form, tiny and miny are operators that transform one game into another. When applied to a number (represented as a game according to the mathematics of surreal numbers) they yield infinitesimal values. For any game or number G, tiny G (denoted by ⧾G in many texts) is the game {0|{0|-G}}, using the bracket notation for combinatorial games in which the left side of the vertical bar lists the game positions that the left player may move to, and the right side of the bar lists the positions that the right player can move to. In this case, this means that left can end the game immediately, or on the second move, but right can reach position G if allowed to move twice in a row. This is generally applied when the value of G is positive (representing an advantage to right); tiny G is better than nothing for right, but far less advantageous. Symmetrically, miny G (analogously denoted ⧿G) is tiny G's negative, or {{G|0}|0}. Tiny and miny aren't just abstract mathematical operators on combinatorial games: tiny and miny games do occur "naturally" in such games as toppling dominoes. Specifically, tiny n, where n is a natural number, can be generated by placing two black dominoes outside n + 2 white dominoes. Tiny games and up have certain curious relational characteristics. Specifically, though ⧾G is infinitesimal with respect to ↑ for all positive values of x, ⧾⧾⧾G is equal to up. Expansion of ⧾⧾⧾G into its canonical form yields {0|{{0|{{0|{0|-G}}|0}}|0}}. While the expression appears daunting, some careful and persistent expansion of the game tree of ⧾⧾⧾G + ↓ will show that it is a second player win, and that, consequently, ⧾⧾⧾G = ↑. Similarly curious, mathematician John Horton Conway noted, calling it "amusing," that "↑ is the unique solution of ⧾G = G." Conway's assertion is also easily verifiable with canonical forms and game trees.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «combinatorics»).
Fonte: Wikipedia in inglese, voce «Tiny and miny» — https://en.wikipedia.org/wiki/Tiny_and_miny
Wikidata Q7808658 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q7808658
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Tiny_and_miny?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1314909542, consultata il 2026-10-31T14:24:34.234Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 5b80b21773b0b64a18f2e0a8a7d3f179a9a0d22cb46046a6c2b8781c9337556d