An IQ test

Sort:
Avatar of theoreticalboy

The problem should specify whether the pirate who proposes the division also gets to vote, I think.

Avatar of ozzie_c_cobblepot

All pirates get to vote, including the guy doing the proposing.

Avatar of ozzie_c_cobblepot

Nope, doesn't work. How do you know that the 12-coin solution doesn't do a similar style of deduction? (it does)

Rule of thumb: beware of solutions to anything which involve the word "just".

Avatar of ozzie_c_cobblepot
Anatoly_Sergievsky wrote:

That was a good one Ozzie. Technically I don't think all pirates are smart enough to figure out how it "should" go, so it might not go according to plan. 

However, in a perfect world, unless I am mistaken, pirate #1 gets nothing as he ends up dead.


Indeed, you are mistaken.

Avatar of ozzie_c_cobblepot

cosdocaila, I think that a real answer would not include words like "what if". Also, for the sake of argument, let's say that something like 996, 1, 1, 1, 1 did work, it is only the correct answer if pirate #1 knows that he cannot get anything better, due to motivation #2.

These are smart pirates.

Avatar of theoreticalboy

Wait, what if it's a tie?  The yay vote takes it?  If so, pirate #5 is going to be happy with anything, because if it comes down to the final two, then #4 will simply vote to get all 100.

Avatar of ozzie_c_cobblepot

The rules state majority, and if you look that up it means greater than half. Half is not a majority.

Avatar of einstein_69101
ozzie_c_cobblepot wrote:

Hey I thought that the 13 coin problem described above was actually the 12 coin problem, and that the 13 coin version was not solvable. I've certainly solved the 12 coin problem, and the 9 coin problem, and the 5 pirates problem, and a whole host of others.

I didn't read through all the solutions to the 13 coin problem. Can someone point me to a post which is a solution? I'm skeptical.


Post #34.  It might be difficult to follow, but I didn't see an error in his post.

Avatar of BoardWarlord
ozzie_c_cobblepot wrote:

Hey I thought that the 13 coin problem described above was actually the 12 coin problem, and that the 13 coin version was not solvable. I've certainly solved the 12 coin problem, and the 9 coin problem, and the 5 pirates problem, and a whole host of others.

I didn't read through all the solutions to the 13 coin problem. Can someone point me to a post which is a solution? I'm skeptical.

Pirates problem: There are 1000 gold coins. There are 5 pirates, let's number them #1 through #5. Here are the rules, which all the pirates agree on.

Pirate #1 will propose a division of the gold (1). There will then be a yes/no vote. If a majority of pirates vote yes, then the gold is distributed as such, and the pirates go their merry ways. If not, then pirate #1 is killed, and pirate #2 gets to propose a division of the gold. And so on.

The other thing to know is what motivates pirates (and hence what motivates their vote). First and foremost, pirates want to live. Next in importance, pirates want gold. Next in importance is that all else being equal, pirates want other pirates dead.

How much gold does pirate #1 get?

--------

(1) A division of the gold is for example when pirate #1 proposes that he gets 200 pieces, also #2 gets 200 pieces, #3 gets 600 pieces, and #4 and #5 both get nothing.


The motives:

1. Live.

2. Gold.

3. Kill.

The most powerful pirate is #5, since he can't die (unless he would vote against himself, which violates motive1). His goal is to stay alive last so he can satisfy all of his motives. To overpower #5 in a vote (and save their lifes), at least #3 and #4 are needed, so both will have to vote for #3's proposal. #3 could take all the gold for himself, and #5 would go out empty handed.

#3 and #4 would still like to see #1 and #2 killed (motive3), so if they can, they will let it come to #3's proposal. If #2 lets #1 get killed, he will be unable to save his own life (since he can never reach a majority against #3 and #4 then).

Since #2 will always vote for #1, #1 only needs to persuade #5 to vote for him, which he must do by offering him an amount of gold which exceeds the motivation of seeing #1 and #2 killed. And if we assume that 1 gold coin (smallest possible amount) always overrides the motivation of killing, the split looks as follows:

999, 0, 0, 0, 1

Avatar of LURCH1
bugoobiga wrote:

what is one half of one plus one?

a. 1

b. 1.5


 b.

Avatar of HessianWarrior

Okay Pirate #1 has two loaded double barreled pistols on his person and says "Eff it" and blows Pirates #2,3,4, and 5 away. Pirate # 1-1,000 coins, and the rest of the poor saps, dirt naps.      

Avatar of ozzie_c_cobblepot
sarsaila wins. good job.
Avatar of HessianWarrior

My answer makes more sense as they were only Pirates not geniuses.

Avatar of yusuf_prasojo
ozzie_c_cobblepot wrote:
sarsaila wins. good job.

Good job sarsaila. You and Cosdocaila won a fat penguin.

Avatar of HessianWarrior
saartje187 wrote:
is a ridle an i.q.-test?i thougt this was an i.q.-test 4095,63,8,3,next number please

 2, If it isn't 2 then let's go with 1.

Avatar of those
[COMMENT DELETED]
Avatar of couchpotatoe
HessianWarrior wrote:

My answer makes more sense as they were only Pirates not geniuses.


Was Black Beard clever or a dumb thief?

Avatar of HessianWarrior
couchpotatoe wrote:
HessianWarrior wrote:

My answer makes more sense as they were only Pirates not geniuses.


Was Black Beard clever or a dumb thief?


 He made it to the history books, good going Blackbeard.

Avatar of theoreticalboy
HessianWarrior wrote:
couchpotatoe wrote:
HessianWarrior wrote:

My answer makes more sense as they were only Pirates not geniuses.


Was Black Beard clever or a dumb thief?


 He made it to the history books, good going Blackbeard.


Then again, so did George W. Bush.

Avatar of theoreticalboy
saartje187 wrote:
hey,i challenged someone for chess 960 ,made the first move and now the game is gone as if it never existed???

Interesting riddle.  My guess is you meant that you made the game 960 days into the future, so it doesn't exist yet?