The Game of Chaos

نویسندگان

  • Peter van Emde Boas
  • Evert van Emde Boas
چکیده

Game of Chaos is a red sorcery in the oldest of all customizable card games: Magic, the Gathering, trademarked by the Wizards of the Coast inc. Successfully casting this spell enables the caster to engage the opponent player in a potentially unbounded series of coin-flip games about life. Initially the ante is one life. The winner decides to stop or to play a next round. However, for every next round the ante in lives is doubled. This will ensure that the game will be terminated as soon as the loser has his total amount of lives reduced to zero or lower, since terminating the game of chaos at this point yields immediate victory of the duel. Given the inherent symmetry of this game the question is whether it offers the caster any strategic advantage to play it. For every possible play which yields a positive outcome there is a corresponding play which yields the same outcome to his opponent. Consequently the utility value of this game should be zero. We invoke elementary game theory in order to illustrate how this theory does confirm this intuition. However, the same theory can also be invoked in different scenarios, like Thorgrim’s last stand where the utility value can be shown to be positive. The illustrations for this note are contained in the powerpoint presentation which is available in pdf format at the website of the first author. See The game of Chaos for 12 pages displaying the sheets presented at the 1999 Dutch Mathematical Conference

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The chaos game on a general iterated function system

The main theorem of this paper establishes conditions under which the ‘chaos game’ algorithm almost surely yields the attractor of an iterated function system. The theorem holds in a very general setting, even for non-contractive iterated function systems, and under weaker conditions on the random orbit of the chaos game than obtained previously.

متن کامل

RECURRENCE RELATIONS , FRACTALS , AND CHAOS 1 Recurrence Relations , Fractals , and Chaos : Implications for Analyzing Gene Structure

The " chaos game " is a well-known algorithm by which one may construct a pictorial representation of an iterative process. The resulting sets are known as fractals and can be mathematically characterized by measures of dimension as well as by their associated recurrence relations. Using the chaos game algorithm, is it possible to derive meaningful structure out of our own genetic encoding, and...

متن کامل

Evolution to the Edge of Chaos in Imitation Game

Motivated by the evolution of complex bird songs, an abstract imitation game is proposed to study the increase of dynamical complexity: Artificial ”birds” display a ”song” time series to each other, and those imitate the other’s song better win the game. With the introduction of population dynamics according to the score of the game and the mutation of parameters for the song dynamics, the dyna...

متن کامل

New Methodology of Block Cipher Analysis Using Chaos Game

Block cipher analysis covers randomness analysis and cryptanalysis. This paper proposes a new method potentially used for randomness analysis and cryptanalysis. The method uses true random sequence concept as a reference for measuring randomness level of a random sequence. By using this concept, this paper defines bias which represents violation of a random sequence from true random sequence. I...

متن کامل

Kato's chaos and P-chaos of a coupled lattice system given by Garcia Guirao and Lampart which is related with Belusov-Zhabotinskii reaction

In this article, we further consider the above system. In particular, we give a sufficient condition under which the above system is Kato chaotic for $eta=0$ and a necessary condition for the above system to be Kato chaotic for $eta=0$. Moreover, it is deduced that for $eta=0$, if $Theta$ is P-chaotic then so is this system, where a continuous map $Theta$ from a compact metric space $Z$ to itse...

متن کامل

The Assessment of Applying Chaos Theory for Daily Traffic Estimation

Road traffic volumes in intercity roads are generally estimated by probability functions, statistical techniques or meta-heuristic approaches such as artificial neural networks. As the road traffic volumes depend on input variables and mainly road geometrical design, weather conditions, day or night time, weekend or national holidays and so on, these are also estimated by pattern recognition te...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999