Strategy-stealing Argument
CHF 39.30
Auf Lager
SKU
F5O2Q33MUJR
1 Verfügbar 
Kostenloser Versand ab CHF 50
Geliefert zwischen Fr., 17.10.2025 und Mo., 20.10.2025
Details
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In combinatorial game theory, the strategy-stealing argument is a general argument that shows, for many games, that the second player cannot have a winning strategy (i.e., a strategy that will always win the game for them, no matter what moves the first player makes). The strategy-stealing argument applies to any symmetric game (one in which either player has the same set of available moves with the same results, so that the first player can "use" the second player''s strategy) in which an extra move can never be a disadvantage. Examples of games to which the argument applies are hex, chomp and the m,n,k-games such as gomoku. In hex ties are not possible, so the argument shows that it is a first-player win.
30 Tage Rückgaberecht
GarantieWeitere Informationen
- Allgemeine Informationen
- GTIN 09786131238734
- Genre Technik
- Editor Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
- Anzahl Seiten 84
- Herausgeber Betascript Publishing
- Größe H220mm x B220mm
- EAN 9786131238734
- Format Fachbuch
- Titel Strategy-stealing Argument
Bewertungen
Schreiben Sie eine Bewertung
