Metraipolis › archive › dc_e34fcfa84308
On (game theory) — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/On_(game_theory)
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-31T10:00:07.464Z
- SHA-256 of the archived text
1231bc761286fd6c9b4bd1ba4ebae6715ede16c369cb4868baa5536e99cebd11- Stable URL of this page
https://metraipolis.com/documento/dc_e34fcfa84308
How to cite
On (game theory) — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/On_(game_theory) (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_e34fcfa84308 (Metraipolis archive dc_e34fcfa84308, sha256 1231bc761286fd6c9b4bd1ba4ebae6715ede16c369cb4868baa5536e99cebd11)
BibTeX
@misc{dce34fcfa84308,
title = {On (game theory) — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/On_(game_theory)},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_e34fcfa84308; sha256 1231bc761286fd6c9b4bd1ba4ebae6715ede16c369cb4868baa5536e99cebd11},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/On_(game_theory). Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In mathematics, specifically combinatorial game theory, on, written as on {\displaystyle {\textbf {on}}} , is the value of the loopy game where Left may only loop back the same position, while Right has no moves. on {\displaystyle {\textbf {on}}} may be represented by surreal form on = { on ∣ } . {\displaystyle {\textbf {on}}=\{{\textbf {on}}\mid \}.} Because of Right's inability to move, on {\displaystyle {\textbf {on}}} is positive, as Left automatically wins. Its negative counterpart, off, written as off {\displaystyle {\textbf {off}}} , may be represented by off = { ∣ off } . {\displaystyle {\textbf {off}}=\{\mid {\textbf {off}}\}.} on {\displaystyle {\textbf {on}}} and off {\displaystyle {\textbf {off}}} are not additive inverses. Their sum, dud (deathless universal draw), written as dud {\displaystyle {\textbf {dud}}} , always loops back to itself, that is, dud = { dud ∣ dud } . {\displaystyle {\textbf {dud}}=\{{\textbf {dud}}\mid {\textbf {dud}}\}.} dud {\displaystyle {\textbf {dud}}} always results in a draw, hence its name. on {\displaystyle {\textbf {on}}} is greater than any ender G {\displaystyle G} , as in the difference game on − G {\displaystyle {\textbf {on}}-G} , Left may play solely in on {\displaystyle {\textbf {on}}} , while Right has no option but to play in − G {\displaystyle -G} . Because − G {\displaystyle -G} is an ender, play in − G {\displaystyle -G} will eventually end, and Left will win. Similarly, off {\displaystyle {\textbf {off}}} is less than any ender.
Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «game theory»).
Fonte: Wikipedia in inglese, voce «On (game theory)» — https://en.wikipedia.org/wiki/On_(game_theory)
Wikidata Q140431295: «concept in combinatorial game theory» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q140431295
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/On_(game_theory)?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 1363917588, consultata il 2026-10-31T09:44:21.609Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 8f3265eb039c972c8627a7bdfe94a6c3e40bab9cfa745e94fc0cf0f5bec3fa6e