Markov Chains and the RISK Board Game (Q4389742)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1154494
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Markov Chains and the RISK Board Game |
scientific article; zbMATH DE number 1154494 |
Statements
5 January 1999
0 references
Markov Chains and the RISK Board Game (English)
0 references
0.7567588090896606
0 references
0.7382493615150452
0 references
0.7088852524757385
0 references
0.7052045464515686
0 references
0.6905934810638428
0 references
Markov chains have been applied in a wide variety of areas, including production, linguistics, finance, marketing, computer science, and signal processing. The first applications of A. A. Markov (1856-1922) were in modeling the progress of consonants and vowels in the writings of Pushkin and Aksakov. We answer two questions of interest to RISK players by using Markov chains. At each turn, a player must decide whether or not to attack a territory. The first question is the following: If you attack a territory with your armies, what is the probability that you will capture this territory? Of course, the probability that you will capture a territory could be high while the expected loss is also high. Therefore, our second question is the following: If you engage in a war, how many armies should you expect to lose depending on the number of armies your opponent has on that territory?
0 references