 | This article relies largely or entirely on a single source .(January 2013) |
The pirate game is a simple mathematical game. It is a multi-player version of the ultimatum game.
| | This article relies largely or entirely on a single source .(January 2013) |
The pirate game is a simple mathematical game. It is a multi-player version of the ultimatum game.
There are five rational pirates (in strict decreasing order of seniority A, B, C, D and E) who found 100 gold coins. They must decide how to distribute them.
The pirate world's rules of distribution say that the most senior pirate first proposes a plan of distribution. The pirates, including the proposer, then vote on whether to accept this distribution. If the majority accepts the plan, the coins are disbursed and the game ends. In case of a tie vote, the proposer has the casting vote. If the majority rejects the plan, the proposer is thrown overboard from the pirate ship and dies, and the next most senior pirate makes a new proposal to begin the system again. The process repeats until a plan is accepted or if there is one pirate left. [1]
Pirates base their decisions on four factors:
To increase the chance of their plan being accepted, one might expect that Pirate A will have to offer the other pirates most of the gold. However, this is far from the theoretical result. When each of the pirates votes, they will not just be thinking about the current proposal, but also other outcomes down the line. In addition, the order of seniority is known in advance so each of them can accurately predict how the others might vote in any scenario. This becomes apparent if we work backwards.
The final possible scenario would have all the pirates except D and E thrown overboard. Since D is senior to E, they have the casting vote; so, D would propose to keep 100 for themself and 0 for E.
If there are three left (C, D and E), C knows that D will offer E 0 in the next round; therefore, C has to offer E one coin in this round to win E's vote. Therefore, when only three are left the allocation is C:99, D:0, E:1.
If B, C, D and E remain, B can offer 1 to D; because B has the casting vote, only D's vote is required. Thus, B proposes B:99, C:0, D:1, E:0.
(In the previous round, one might consider proposing B:99, C:0, D:0, E:1, as E knows it won't be possible to get more coins, if any, if E throws B overboard. But, as each pirate is eager to throw the others overboard, E would prefer to kill B, to get the same amount of gold from C.)
With this knowledge, A can count on C and E's support for the following allocation, which is the final solution:
(Note: A:98, B:0, C:0, D:1, E:1 or other variants are not good enough, as D would rather throw A overboard to get the same amount of gold from B.)
The solution follows the same general pattern for other numbers of pirates and/or coins. However, the game changes in character when it is extended beyond there being twice as many pirates as there are coins. Ian Stewart wrote about Steve Omohundro's extension to an arbitrary number of pirates in the May 1999 edition of Scientific American and described the rather intricate pattern that emerges in the solution. [2]
Supposing there are just 100 gold pieces, then:
In general, if G is the number of gold pieces and N (> 2G) is the number of pirates, then
Another way to see this is to realize that every pirate M will have the vote of all the pirates from M/2 + 1 to M out of self preservation since their survival is secured only with the survival of the pirate M. Because the highest ranking pirate can break the tie, the captain only needs the votes of half of the pirates over 2G, which only happens each time (2G + a Power of 2) is reached. For instance, with 100 gold pieces and 500 pirates, pirates #500 through #457 die, and then #456 survives (as 456 = 200 + 28) as they have the 128 guaranteed self-preservation votes of pirates #329 through #456, plus 100 votes from the pirates they bribe, making up the 228 votes that they need. The numbers of pirates past #200 who can guarantee their survival as captain with 100 gold pieces are #201, #202, #204, #208, #216, #232, #264, #328, #456, #712, etc.: they are separated by longer and longer strings of pirates who are doomed no matter what division they propose.
In number theory, two integers a and b are coprime, relatively prime or mutually prime if the only positive integer that is a divisor of both of them is 1. Consequently, any prime number that divides a does not divide b, and vice versa. This is equivalent to their greatest common divisor (GCD) being 1. One says also ais prime tob or ais coprime withb.
The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so that no two queens threaten each other; thus, a solution requires that no two queens share the same row, column, or diagonal. There are 92 solutions. The problem was first posed in the mid-19th century. In the modern era, it is often used as an example problem for various computer programming techniques.
A Pythagorean triple consists of three positive integers a, b, and c, such that a2 + b2 = c2. Such a triple is commonly written (a, b, c), a well-known example is (3, 4, 5). If (a, b, c) is a Pythagorean triple, then so is (ka, kb, kc) for any positive integer k. A triangle whose side lengths are a Pythagorean triple is a right triangle and called a Pythagorean triangle.
The wave equation is a second-order linear partial differential equation for the description of waves or standing wave fields such as mechanical waves or electromagnetic waves. It arises in fields like acoustics, electromagnetism, and fluid dynamics.
The Universal Product Code is a barcode symbology that is used worldwide for tracking trade items in stores.
The Tower of Hanoi is a mathematical game or puzzle consisting of three rods and a number of disks of various diameters, which can slide onto any rod. The puzzle begins with the disks stacked on one rod in order of decreasing size, the smallest at the top, thus approximating a conical shape. The objective of the puzzle is to move the entire stack to one of the other rods, obeying the following rules:
Dynamic programming is both a mathematical optimization method and an algorithmic paradigm. The method was developed by Richard Bellman in the 1950s and has found applications in numerous fields, from aerospace engineering to economics.
In mathematics, and more specifically in algebraic topology and polyhedral combinatorics, the Euler characteristic is a topological invariant, a number that describes a topological space's shape or structure regardless of the way it is bent. It is commonly denoted by .
In physics and mathematics, a brachistochrone curve, or curve of fastest descent, is the one lying on the plane between a point A and a lower point B, where B is not directly below A, on which a bead slides frictionlessly under the influence of a uniform gravitational field to a given end point in the shortest time. The problem was posed by Johann Bernoulli in 1696.
Bartholomew Roberts, born John Roberts, was a Welsh pirate who was, measured by vessels captured, the most successful pirate of the Golden Age of Piracy. During his piratical career, he took over 400 prize ships, although most were mere fishing boats. Roberts raided ships off the Americas and the West African coast between 1719 and 1722; he is also noted for creating his own pirate code, and adopting an early variant of the Skull and Crossbones flag.
A powerful number is a positive integer m such that for every prime number p dividing m, p2 also divides m. Equivalently, a powerful number is the product of a square and a cube, that is, a number m of the form m = a2b3, where a and b are positive integers. Powerful numbers are also known as squareful, square-full, or 2-full. Paul Erdős and George Szekeres studied such numbers and Solomon W. Golomb named such numbers powerful.
Collision theory is a principle of chemistry used to predict the rates of chemical reactions. It states that when suitable particles of the reactant hit each other with the correct orientation, only a certain amount of collisions result in a perceptible or notable change; these successful changes are called successful collisions. The successful collisions must have enough energy, also known as activation energy, at the moment of impact to break the pre-existing bonds and form all new bonds. This results in the products of the reaction. The activation energy is often predicted using the Transition state theory. Increasing the concentration of the reactant brings about more collisions and hence more successful collisions. Increasing the temperature increases the average kinetic energy of the molecules in a solution, increasing the number of collisions that have enough energy. Collision theory was proposed independently by Max Trautz in 1916 and William Lewis in 1918.
Circumscription is a non-monotonic logic created by John McCarthy to formalize the common sense assumption that things are as expected unless otherwise specified. Circumscription was later used by McCarthy in an attempt to solve the frame problem. To implement circumscription in its initial formulation, McCarthy augmented first-order logic to allow the minimization of the extension of some predicates, where the extension of a predicate is the set of tuples of values the predicate is true on. This minimization is similar to the closed-world assumption that what is not known to be true is false.
Methods of computing square roots are algorithms for approximating the non-negative square root of a positive real number . Since all square roots of natural numbers, other than of perfect squares, are irrational, square roots can usually only be computed to some finite precision: these methods typically construct a series of increasingly accurate approximations.
The Black Pearl is a fictional ship in the Pirates of the Caribbean film series. In the screenplay, the ship is easily recognized by her distinctive black hull and sails. Captained by Captain Jack Sparrow and Hector Barbossa, the Black Pearl is said to be "nigh uncatchable". In the first three films, she either overtakes or flees all other ships, including both the Interceptor, which is regarded as the fastest ship in the Caribbean, and the Flying Dutchman, which is faster than the wind. Her speed is derived from several factors such as the large number of sails she carries and being partly supernatural. As stated in Dead Man's Chest and At World's End, the Black Pearl is "the only ship that can outrun the Dutchman" and this is evidenced in the maelstrom battle between the two ships in the movies.
Parrondo's paradox, a paradox in game theory, has been described as: A combination of losing strategies becomes a winning strategy. It is named after its creator, Juan Parrondo, who discovered the paradox in 1996. A more explanatory description is:
Pirate Master is an American reality television show created by Mark Burnett and broadcast on CBS. The show followed sixteen modern-day pirates on their quest for a gold treasure valued at US$1,000,000. The show was hosted by Cameron Daddo and was filmed around and on the Caribbean island nation of Dominica.
A balance puzzle or weighing puzzle is a logic puzzle about balancing items—often coins—to determine which holds a different value, by using balance scales a limited number of times. These differ from puzzles that assign weights to items, in that only the relative mass of these items is relevant.
In number theory, Fermat's Last Theorem states that no three positive integers a, b, and c satisfy the equation an + bn = cn for any integer value of n greater than 2. The cases n = 1 and n = 2 have been known since antiquity to have infinitely many solutions.
Fermat's Last Theorem is a theorem in number theory, originally stated by Pierre de Fermat in 1637 and proven by Andrew Wiles in 1995. The statement of the theorem involves an integer exponent n larger than 2. In the centuries following the initial statement of the result and before its general proof, various proofs were devised for particular values of the exponent n. Several of these proofs are described below, including Fermat's proof in the case n = 4, which is an early example of the method of infinite descent.