# Web Puzzles

Showing posts with label puzzle. Show all posts

## The Snail And The Well

There was a small snail at the bottom of a thirty foot well. In desperation to get out, the snail was only able to climb up three feet during the daytime, and reluctantly slide back down two feet at night.

At this pace, how many days and nights will it take the snail to reach the top of the well?

### The Snail And The Well Puzzle Solution

After traveling 3 feet up, then sliding 2 feet down, the snail had a net gain of 1 foot per day and night. One would think, 1 foot per day and night, 30 foot deep well, 30 days and nights! But that's wrong.

After 26 days and nights, the snail is 26 feet up the well. So the snail starts the 27th day at 26 feet. At the end of the 27th day, the snail has travelled to 29 feet, but during the 27th night, it slides down to 27 feet. So, on the 28th day, the snail travels 3 feet up and reaches the top of the well.

So, the final answer is 28 days and 27 nights.

## Sailor's Delight

10 pirates are ranked in order, first to last. After finding a treasure chest of 100 gold coins, they are discussing how to divide up the booty. They allow the lowest ranked sailor to divide up the coins and then vote on his idea. If the number of pirates who like the division is equal to or greater than the others who don't like it, then the boss will say, "Make it So." (The proposer of the idea also has a vote.)

Otherwise... well, being pirates their simple solution is to dump the unfortunate sailor into the deep blue sea and let the next pirate in line decide how to divide up the spoils.

How many pirates will be thrown into the sea?

Notes:
• Pirates are smart, want money, and love life, especially their own!
• This one is harder than average. If you are stuck, think of fewer pirates...
• Why would #1 ever vote for any schemes?
• Why would #2 ever vote for any schemes?
• ... hmmmm

### Sailor's Delight Puzzle Solution

We asked you readers to send us a solution to this puzzle, and we kept an open mind about it.
The first person with a simple, elegant, and, in our opinion, valid solution, is Saurabh Gupta, a faithful reader and avid puzzler. Here is Saurabh's solution.

How many pirates will be thrown into the sea? None. And the correct distribution is:
Pirate
with rank
Number
of coins
1 0
2 1
3 0
4 1
5 0
6 1
7 0
8 1
9 0
10 96

Pirate 10 divided the coins. He will get the votes of pirates 2, 4, 6, 8, and himself. This is taking into consideration what each of the pirates will get if this plan is not passed.

Starting with a situation when there is only pirate 1. He keeps all the 100 coins for himself and live happily by passing the division with his only vote.

In case that there are two pirates, pirate 2 divides and he keeps 100 coins for himself while giving none to pirate 1. He still gets the division passed with his vote and live happily ever after.
In case there are three pirates, pirate 3 divides and gives pirate 1 a single coin and keeps the other 99 coins for himself. Pirate 1 would now vote in his favor because if he votes against, then pirate 2 would get a chance to divide and would keep all the loot for himself.

If four pirates are present, pirate 4 divides and now gives pirate 2 a single coin to gain his vote (who otherwise gets nothing if pirate 3 has a chance to divide the coins). In this case, pirates 1 and 3 get nothing.

Therefore, in a similar manner, the distribution when there is an extra pirate is achieved as follows:

With 5 pirates,
pirate 5 divides:
Pirate
with rank
Number
of coins
1 1
2 0
3 1
4 0
5 98
With 6 pirates,
pirate 6 divides:
Pirate
with rank
Number
of coins
1 0
2 1
3 0
4 1
5 0
6 98
With 7 pirates,
pirate 7 divides:
Pirate
with rank
Number
of coins
1 1
2 0
3 1
4 0
5 1
6 0
7 97
With 8 pirates,
pirate 8 divides:
Pirate
with rank
Number
of coins
1 0
2 1
3 0
4 1
5 0
6 1
7 0
8 97
With 9 pirates,
pirate 9 divides:
Pirate
with rank
Number
of coins
1 1
2 0
3 1
4 0
5 1
6 0
7 1
8 0
9 96
With 10 pirates,
pirate 10 divides:
Pirate
with rank
Number
of coins
1 0
2 1
3 0
4 1
5 0
6 1
7 0
8 1
9 0
10 96
This solution holds because all pirates are rational and think through the situation. They understand that they don't get anything if the next ranked pirate gets a chance to make the division.

There is, however, still some doubt about this solution. After all, it was said that pirates are smart. With this solution, based on a method of dividing the booty supposedly approved by all, it is shown that only one (the last one) is very smart, while 4 of them get only a coin, and 5 of them get nothing. This seems to be in conflict with the statement that pirates are smart. Even if the method was approved only by half of them (the ones who get at least a coin), 4 of these voters don't seem very smart if they get only one coin. Certainly, it couldn't have been a dictatorship decision taken by the leader, as he ends up empty-handed.

An alternative, to make the pirates look brighter, is that the dividing pirate actually shares the loot evenly between the pirates likely to give him a positive vote. In that case, the pirates who previously got only one coin, end up getting just as much as the lowest ranked, while the others get nothing again. This would entail the following solution:
Pirate
with rank
Number
of coins
1 0
2 20
3 0
4 20
5 0
6 20
7 0
8 20
9 0
10 20

This alternative solution, however, defies a bit the mechanism of the division logic and process explained in the main solution. Perhaps, it would be fair to make a re-wording of the puzzle, stating that, although pirates are smart, the method of dividing the booty is forced on them by some external entity, and no pirate, not even the leader, can oppose to it. However, a rewording of the puzzle will NOT take place, as this is how it was presented on Brent's page, and we are going to preserve it.

Also, it might be possible that this is not the only acceptable solution, and another alternative solution might exist, that doesn't raise any doubts with the puzzle premises.

## 12 Balls

You have twelve balls that all weigh the same except one, which is either slightly lighter or slightly heavier. The only tool you have is a balance scale that can only tell you which side is heavier.

Using only three weighings, how can you deduce, without a shadow of a doubt, which is the odd one out, and if it is heavier or lighter than the others?

### 12 Balls Puzzle Solution

We found a good solution to this puzzle on the Cut The Knot website. They show a solution taken from the book Mathematical Spectrum, by Brian D. Bundy. Bundy shows two solutions: the first one requires different courses of action depending on the outcome of previous weighings, so it is not particularly elegant or easy to remember. The second solution involves a fixed course of action in all circumstances, and is the one that follows.

In this method we weigh four specified balls against four other specified balls in each of the three weighings and note the result. If we observe say the left hand side of the balance, then for an individual weighing there are three possible alternatives: the left hand side is heavy (>), light (<) or equal (=) as compared with the right hand side of the balance.

Since three weighings are allowed, the number of different results that can be obtained is just the number of arrangements (with repetitions allowed) of the three symbols >, <, =, i.e. 3 3 = 27. If we use all twelve balls in the three weighings, and ensure that no particular ball appears on the same side of the balance in all three weighings, the outcomes >>>, <<<, === are not possible. We thus have only 24 possible outcomes and we shall show that it is possible to set up a one to one correspondence between these 24 outcomes and the conclusion that a particular ball among the twelve is heavy or light.

The 24 outcomes can be divided into two groups of twelve in each group. If we call the reverse of an outcome the outcome obtained by replacing > by <, < by > and leaving = unchanged, one group of twelve will be the reverses of the other group and vice versa. We can thus write the 24 outcomes in the form of two arrays, each array having three rows (the three weighings) and twelve columns (the twelve balls), so that each row contains four >'s, four <'s and four ='s. Thus we have, for example,
> > > >   < < < <   = = = =
< = = =   < < > >   > < > =
=
> < =   > = < >   > = < <
A
B C D   E F G H   I J K L
<
< < <   > > > >   = = = =
> = = =   > > < <   < > < =
= < > =   < = > <   < = > >

We consider just the top array, and for each weighing (row) place the balls corresponding to a > in the left, and the balls corresponding to a < in the right of the balance. Thus we would weigh A, B, C, D against E, F, G, H; then G, H, I, K against A, E, F, J; and finally B, E, H, I against C, G, K, L. The results of these three weighings as observed on the left of the balance are noted. If the outcome is >, <, = we conclude that ball A is heavy; if >, =, > ball B is heavy, etc; if =, =, < ball L is heavy. If we obtain an outcome that appears in the lower array, we conclude that the corresponding ball is light. Thus for <, >, = ball A is light, etc; =, =, > means ball L is light.

## Hugh's Horses

A horse breeder goes to a horse show with a certain number of horses. The first buyer comes by and purchases half of the horses the breeder brought plus half a horse. The second buyer comes by and purchases half of what remains plus half a horse. The third buyer comes by and purchases half of what remains plus half a horse. The breeder leaves, satisfied that he has sold all the horses he brought.

All three buyers have purchased whole horses, and there is no shared ownership among them.

How many horses did the breeder bring to the show?

### Hugh's Horses Puzzle Solution

(0.5 + 0.5) + (0.5 + 1.5) + (0.5 + 3.5) = 7.

Or here's a an algebraic solution kindy submitted by Greg Bradshaw. Thanks!

Solve for x where x is the total number of horses:

x = (.5x + .5) + (.5(.5x - .5) + .5) + (.5[.5{.5x - .5} - .5] + .5)
x = .5x + .5 + .25x - .25 + .5 + .5(.25x - .25 -.5) + .5
x = .5x + .5 + .25x + .25 + .5(.25x - .75) + .5
x = .5x + .5 + .25x + .25 + .125x - .375 + .5
x = .5x + .5 + .25x + .25 + .125x + .125
x = .875x + .875
.125x = .875
x = .875/.125
x = 7

## The Dog Situation

The Rector's four boys have done their best to make the dog situation at the rectory confusing. Each of the four, their names Alec, Bob, Charlie, and David, owns two dogs, and each has named his dogs after two of his brothers. Each boy has, in consequence, two doggy namesakes.

Of the eight dogs, three are cocker spaniels, three are terriers, and two are dachshunds. None of the four boys owns two dogs of the same breed. No two dogs of the same breed have the same name. Neither of Alec's dogs is named David and neither of Charlie's dogs is named Alec. No cocker spaniel is named Alec, and no terrier is named David. Bob does not own a terrier.

What are the names of the dachshunds, and who are their owners?

### The Dog Situation Puzzle Solution

One of the dachshunds is owned by Bob and is named Alec, while the other is owned by Charlie and is called David.

To get to the solution, let's gather all the information we're given:

1 Each boy has named his dogs after two of his brothers
2 Each boy has two doggy namesakes
3 There are 3 cocker spaniels, 3 terriers, and 2 dachshunds
4 None of the four boys owns two dogs of the same breed
5 No two dogs of the same breed have the same name
6 Neither of Alec's dogs is named David
7 Neither of Charlie's dogs is named Alec
8 No cocker spaniel is named Alec
9 No terrier is named David
10 Bob does not own a terrier

With this info, it follows that:

11 Alec's dogs are named Bob and Charlie (from 6 and 1)
12 Charlie's dogs are named Bob and David (from 7 and 1)
13 David's dogs are named Alec and Charlie (from 11, 12, 1 and 2)
14 Bob's dogs are named Alec and David (from 11, 12, 13, 1 and 2)
15 Bob's dogs are a cocker and a dachshund (from 3, 4 and 10)
16 The 3 cockers are called Bob, Charlie, and David (from 3, 5 and 8)
17 The 3 terriers are called Alec, Bob, and Charlie (from 3, 5 and 9)
18 The 2 dachshunds are called Alec and David, because the names Bob and Charlie are already taken by cockers and terriers (from 2, 3, 16 and 17)
19 Bob's dachshund must be called Alec, because there are no cockers with that name (from 14, 15, 16 and 18)
20 Bob's cocker is called David (from 14, 15, 16, 18 and 19)
21 The dachshund called David must belong to Charlie (from 12, 18 and 20)

Deductions 19 and 21 have given us the solution to the puzzle.

## Who Owns The Zebra?

There are five houses.
Each house has its own unique color.
All house owners are of different nationalities.
They all have different pets.
They all drink different drinks.
They all smoke different cigarettes.
The English man lives in the red house.
The Swede has a dog.
The Dane drinks tea.
The green house is on the left side of the white house.
They drink coffee in the green house.
The man who smokes Pall Mall has birds.
In the yellow house they smoke Dunhill.
In the middle house they drink milk.
The Norwegian lives in the first house.
The man who smokes Blend lives in the house next to the house with cats.
In the house next to the house where they have a horse, they smoke Dunhill.
The man who smokes Blue Master drinks beer.
The German smokes Prince.
The Norwegian lives next to the blue house.
They drink water in the house next to the house where they smoke Blend.

So, who owns the Zebra?

### Who Owns The Zebra? Puzzle Solution

The German owns the zebra!
#1 #2 #3 #4 #5
Nationality Norwegian Dane English German Swede
Colour Yellow Blue Red Green White
Drink Water Tea Milk Coffee Beer
Cigarettes Dunhill Blend Pall Mall Prince Blue Master
Pets Cats Horse Birds Zebra Dog

## Socks And Shops

Sarks and Mencer's was a brand new shop built in the basement floor of a shopping centre. To mark their opening day, they had many special offers. The most popular was the buy ten pairs of socks for half price. Each pair of socks were attached together with a plastic clip that doubled as a miniture hanger whilst on display. There was only a single size and only ten colours to choose from, which is why both Andrew and Bob each chose one of each colour. Each armed with ten pairs of differently coloured socks, they were moving towards the checkout when there was a power failure. They bumped into each other and dropped all twenty pairs of socks.

Without being able to see the colour of the socks, how could they divide them so that they both got 10 pairs of uniquely coloured socks each?

### Socks And Shops Puzzle Solution

For each of the twenty pairs of socks, they unclipped it and gave one sock each.

## Strawberry Ice Cream

A man walks into a bar, orders a drink, and starts chatting with the bartender.

After a while, he learns that the bartender has three children. "How old are your children?" he asks.
"Well," replies the bartender, "The product of their ages is 72."

The man thinks for a moment and then says, "That's not enough information."

"All right," continues the bartender. "If you go outside and look at the building number posted over the door to the bar, you'll see the sum of the ages."

The man steps outside, and after a few moments he reenters and declares, "Still not enough!"

The bartender smiles and says, "My youngest just loves strawberry ice cream."

How old are the children?

### Strawberry Ice Cream Puzzle Solution

First, determine all the ways that three ages can multiply together to get 72:
• 72 1 1 (quite a feat for the bartender)
• 36 2 1
• 24 3 1
• 18 4 1
• 18 2 2
• 12 6 1
• 12 3 2
• 9 4 2
• 9 8 1
• 8 3 3
• 6 6 2
• 6 4 3
As the man says, that's not enough information; there are many possibilities.

So the bartender tells him where to find the sum of the ages--the man now knows the sum even though we don't. Yet he still insists that there isn't enough info. This must mean that there are two permutations with the same sum; otherwise the man could have easily deduced the ages.

The only pair of permutations with the same sum are 8 3 3 and 6 6 2, which both add up to 14 (the bar's address). Now the bartender mentions his "youngest"--telling us that there is one child who is younger than the other two. This is impossible with 8 3 3--there are two 3 year olds. Therefore the ages of the children are 6, 6, and 2.

Pedants have objected that the problem is insoluble because there could be a youngest between two three year olds (even twins are not born exactly at the same time). However, the word "age" is frequently used to denote the number of years since birth. For example, I am the same age as my wife, even though technically she is a few months older than I am. And using the word "youngest" to mean "of lesser age" is also in keeping with common parlance. So I think the solution is fine as stated.

## Hansel And Gretal

I walk in a straight line in the forest. As I walk, I leave a repeating pattern of 1's and 0's behind me.

What is the length of the shortest pattern such that if you happen along my trail, you can determine with certainty which direction I was going?

### Hansel And Gretal Puzzle Solution

One solution is 010011, and is probably the shortest. In a repeating series of this pattern, we may get:
...11010011010011010011010011...

If we are to look through the sequence, we should find that we can match the pattern 010011 but not the reverse pattern, 110010. Hence we know which direction the person was travelling.
...11010011010011010011010011...

## TV Show

The host of the show pointed at three doors. He claimed that, behind one of the doors, a brand new sportscar was awaiting a lucky winner. The other two doors, he warned, did not lead to any prize.

The contestant picked the first door as his guess. At that point, the host walked to the third door and opened it. The door led to no prize, which is something the host knew perfectly well. He then gave the chance to the contestant to switch and pick the second door, if he so wished, or to stick to his first choice and stay with the first door.

Did the contestant have a greater chance of winning the car, by sticking with the 1st door, or by switching to the 2nd door? Or were the chances equal?

Notes:
The contestant knew three things: first, that the host doesn't want him to win; second, that the host was going to open one of the doors; and third, that the host would never open the door picked by the contestant himself... regardless of where the prize really is.

### TV Show Puzzle Solution

This puzzle isn't particularly new, but it became very well known in 1990, thanks to the person that allegedly had "the highest IQ ever recorded" -- 228, according to The Guinness Book of WorldRecords. Miss Marilyn vos Savant (yes, it was a female) wrote a solution to this puzzle on her weekly column, published in a popular magazine. This solution led to waves of mathematicians, statisticians, and professors to very heated discussions about the validity of it.

The contestant, according to vos Savant, had a greater chance of winning the car by switching his pick to the 2nd door.

She claimed that by sticking to the first choice, the chances of winning were 1 out of 3, while the chances doubled to 2 out of 3 by switching choices. To convince her readers, she invited her readers to imagine 1 million doors instead of just 3. "You pick door number 1," she wrote, "and the host, who knows what's behind every door, and doesn't want you to win, opens all of the other doors, bar number 777,777. You wouldn't think twice about switching doors, right?"

Most of her readership didn't find it as obvious as she thought it was... She started receiving a lot of mail, much of it from mathematicians, who didn't agree at all. They argued that the chances were absolutely equal, whether or not the contestant switched choice.

The week after, she attempted to convince her readers of her reasoning, by creating a table where all 6 possible outcomes were considered:

 Door 1 Door 2 Door 3 Outcome (sticking to door 1) Car Nothing Nothing Victory Nothing Car Nothing Loss Nothing Nothing Car Loss Door 1 Door 2 Door 3 Outcome (switching to other door) Car Nothing Nothing Loss Nothing Car Nothing Victory Nothing Nothing Car Victory

The table, she explained, shows that "by switching choices you win 2 out of 3 times; on the other hand, by sticking to the first choice, you win only once out of of 3 times".

However, this wasn't enough to silence her critics. Actually, it was getting worse.

"When reality seems to cause such a conflict with good sense," wrote vos Savant, "people are left shaken." This time, she tried a different route. Let's imagine that, after the host shows that there's nothing behind one of the doors, the set becomes the landing pad for a UFO. Out of it comes a little green lady. Without her knowing which door was picked first by the contestant, she is asked to pick one of the remaining closed doors. The chances for her to find the car are 50%. "That's because she doesn't have the advantage enjoyed by the contestant, ie the host's help. If the prize is behind door 2, he will open door 3; if it is behind door 3, he will open door 2. Therefore, if you switch choice, you will win if the prize is behind door 2 or 3. YOU WIN IN EITHER CASES! If you DON'T switch, you'll win only if the car is behind door 1".

Apparently, she was absolutely right, because the mathematicians reluctantly admitted their mistake.

## The Package

G answered his ringing mobile phone. "G here."

"It's H. Do you have the package?"

"Yes. I have the object, in its box."

"Very good," said H. "So send the box to me using the lock I gave you last time we met."

"I'm afraid I can't," said G hestitantly.

"Why not? The locking ring on the box is more than large enough to fit a lock on."

"I seem to have um, misplaced the lock."

"You what!" snarled H. "Do you have any other locks?"

"Yes, but you don't have the keys to them. We can't risk sending an unsecured box, nor an unsecured key. Sending an unlocked lock is out of the question, because they re-lock themselves automatically after a 2 minute timeout."

"Ah, all is not lost... I have an spare lock here... How much time do we have?"

"Plenty," replied G.

"Good. There is a way…

How can they get the box and the object from G to H without any security risk?

Notes:
• They can't meet in person -- that would render the puzzle pointless.
• No, G can't go and look for the misplaced lock!
• You cannot send a key by itself or in an unlocked box.

### The Package Puzzle Solution

With the object in the box, G locks it with one of his own locks. He then sends the box to H. H attaches his own lock in addition to G's and then sends it back. G removes his lock and then sends it to H again.

## Trick Mules

Start with the three puzzle pieces arranged so that the two jockeys are correctly riding the two weary-looking mules.

Rearrange the pieces so that the mules miraculously break into a frenzied gallop!

Notes:
The mules do not overlap. There is a clever, but not deceptive solution to this puzzle.

### Trick Mules Puzzle Solution

This ambiguous "Trick Mules Puzzle" is solved by the realisation that the mule can have two different orientations. Here the same lines and contours have two interpretations, one horizontal and one vertical.

## Camel Race

The time had come when the father of two sons was to decide who would receive his fortune.
They both kneeled before the aged man as he spoke. "You will both race your camels to the nearest city. The owner of whichever camel arrives at the gates second will receive my fortunes."

Confused, both men rode their camels toward the city, step by step, as slow as they could. As luck would have it, the Great Sage was passing by. Seeing him, they pleaded for his wisdom.

"How might we resolve this such that it doesn't take the rest of our lives," said the first man.
"And yet it must be in a competitive manner," added the second. "Neither of us are willing to concede."

The Great Sage stroked his beard and shared his wisdom.

On hearing his advice, both men ran back to the camels and raced toward the city as fast as they could.

What was the Great Sage's suggestion?

### Camel Race Puzzle Solution

The Great Sage told them to swap camels. It is the second camel, not person, to reach the city gates who wins.

## Sherwood Forest

"A three-way duel is an old tradition in these lands," said Robin Hood, "because it is unlikely that between two champions, there shouldn't come a third party in between, to show he is the bravest.

Miller, Allan-a-Dale, and Brother Tuck now battle like real thieves, and may the best win. Here are the crossbows, each of them with its own set of arrows. The three crossbows are all slightly different, and each set of arrows works only on the crossbow it was designed for. Unfortunately, only one set of arrows is flawless: a quarter of the set of arrows of the second crossbow is faulty, as is an incredible half of the third set. A faulty arrow is indistinguishable from a good one until it is shot. Now, go on, pick a straw, and let fate be fulfilled."

Robin Hood showed his clenched fist, from which three straws stuck out. Miller was the luckiest, having picked the longest straw, while Brother Tuck stared at his short straw with an expression of dread, for he knew full well that none of the three men would miss a target with a good arrow. "Well, Miller, here it is: the king of all crossbows. You have a 100% chance of killing your target. Allan-a-Dale, I hand you the crossbow with a few faulty arrows: with it, your chances are 75%. And there you are, Brother Tuck: the 50% crossbow. But then, a religious man like you could even duel with only your spiritual belief."

The fit monk breathed deep, and muttered, "God almighty, Robin, you want to see me dead. It is not possible to duel in these conditions."

"You are right, Brother Tuck," replied Robin Hood, after thinking for a little while. "Here is what we will do. You, Brother Tuck, will have the right to shoot first, after choosing your desired position on the field. Friends, please remember the rules: you will take position on the corners of an imaginary triangle, each of you 80 yards away from the other two. The order in which you will take turns to shoot is clockwise. On your turn, you may choose which of the other two you wish to shoot. Get ready: it is time to duel!"

Brother Tuck gulped as he chose his position, a taunting raven fluttering overhead squawking songs of doom.
What position (A or B) did Brother Tuck choose, and which adversary did he shoot first, in order to have the highest chance of survival?

### Sherwood Forest Puzzle Solution

Since the order of turns was clockwise, Brother Tuck went to position B, and deliberately missed his firts shot (perhaps he should shoot the raven).

Assuming that missing the first shot gives Brother Tuck the best chance that one of the dangerous adversaries gets killed from the other before becoming himself the target (obviously, both Miller and Allan-a-Dale opt to use their first turn to shoot at the most dangerous adversary), it is necessary to consider the chances of shooting from position A and the chances from position B.

By assuming position at A, and missing the first shot (as it is right in the circumstances), Brother Tuck knows that he wouldn't be Miller's target, because Allan-a-Dale is more dangerous. Allan-a-Dale would certainly be killed (Miller's crossbow has 100% chances of hitting the target). At this point, it would again be the monk's turn (with Allan not being in a condition to take his turn), who has a 50% chance of hitting the other survivor, ie Miller, and to therefore end the duel. Obviously, if the religious man misses, then he could only get on his knees and pray, because Miller's next shot would be faultless. So, by choosing position A, Brother Tuck has a 50% chance of survival.

If Brother Tuck chooses position B, and deliberately misses his first shot, the next turn would be Allan-a-Dale's, who would choose the most dangerous adversary, ie Miller. At this point, two different outcomes can happen:

1. Allan misses Miller (25% chances); at this point, Miller will use his turn to shoot Allan. Then it will be Tuck's turn, who will have one chance out of two to pick one of the good arrows (so, it's 50% chances, but it's 50% of 25%, ie 1/8).

2. Allan hits Miller (75% chances); at this point, Brother Tuck will shoot Allan, with 50% chances of success; but this is 50% of 75%, ie 3/8 which, if added to 1/8 of the first outcome, gives Tuck 4/8, ie 50% chances of survival. In case that his shot misses, Tuck would not be a sure victim of Allan's next shot, who might miss with 25% chances. This gives the monk a further 3/32 probabilities (ie 3/4 * 1/2 * 1/4).

The calculation, as shown here, could keep going on and on until the last arrow, and demonstrates that, by choosing position B, Brother Tuck has, besides the 50% chances also offered by position A, a long string of small chances (3/32, 3/256, etc), that are possible if Allan-a-Dale misses at least one (his first, and eventually the next ones) shot at the monk.

## Golf

Jack, Levi, Seth, and Robert were, not necessarily in this order, a Stock Broker, a Musician, a Doctor, and a Lawyer. They drove, also not necessarily in order, a Porsche, a Ferrari, a Cadillac, and a Corvette.

The Stock Broker, was remarking to no one in particular one day, while finishing up a round of golf which involved all four friends, that he found it curious that Jack and the Lawyer each wanted to buy the Corvette, but that the Musician didn't because he preferred his Porsche. After the game was over, Seth offered to buy a round of sodas for the Doctor, for the owner of the Cadillac, and for the owner of the Corvette. Levi, who was beaten by the Stock Broker, was in a bad mood, and so he declined Seth's offer and left without joining the others in the club house.

What car did each person own, and what were their respective occupations

### Golf Puzzle Solution

The clues given in the puzzle are:
• The Stock Broker is not Levi.
• Jack is not the Lawyer; neither Jack nor the Lawyer owns the Corvette.
• The Musician owns the Porsche; therefore no one else owns the Porsche and the Musician owns no other car.
• Seth is not the owner of the Cadillac, the Corvette, nor is he the Doctor; also, the Doctor does not own either the Cadillac or the Corvette either.
By Reasoning:
• The Doctor, by elimination, must own the Ferrari; the Lawyer must own the Cadillac; the Stock Broker must own the Corvette.
• Tne Stock Broker owns the Corvette. Neither Seth nor Jack own the Corvette, so the Stock Broker must be Robert; since the Stock Broker drives the Corvette, then Robert drives the Corvette.
• The Lawyer owns the Cadillac. Seth does not own the Cadillac; therefore Seth is not the Lawyer; therefore Seth is the Musician; the Musician owns the Porsche; therefore Seth owns the Porsche.
• By elimination, Jack is the Doctor; the Doctor owns the Ferrari; therefore Jack owns the Ferrari.
• By elimination, Levi owns the Cadillac.
The Solution:
• Seth is the Musician and owns the Porsche.
• Levi is the Lawyer and owns the Cadillac.
• Jack is the Doctor and owns the Ferrari.
• Robert is the Stock Broker and owns the Corvette.

## Mountaineer

An Austrian mountaineer left Zurglatt, his village, at eight o'clock in the morning, and started his climb towards the refuge Tirpitz, on Gross Glossen mountain. He walked at a steady pace, without stopping, and his increase in heart pulse rate was negligible. He reached the refuge at three in the afternoon, i.e. seven hours since he left the village. At the refuge he rested, admired the view, scribbled some notes on his diary, sang three lieder, ate two sausages and drank a litre of beer. He then slipped into his sleeping bag and fell asleep.

The next morning, at eight o'clock, he started his descent, again with a steady pace, but faster, since he was travelling downhill. He reached Zurglatt at one in the afternoon, after walking for five hours.

Could there be a point along the path where the mountaineer walked, on the outbound and the return journey, exactly at the same time of day?

### Mountaineer Puzzle Solution

Of course there is. To make sure, imagine two mountaineers: one is in the village, and the other one is at the refuge. They'll both leave at eight o'clock, travel along the same path as our mountaineer, and at his same speed. At some point along the path they'll obviously meet.

## General Manoeuvres

A platoon of 40 soldiers, inclusive of troopers, senior soldiers, sergeants and commander, was standing by the bank of a river. In order to cross it, they found only a small rubber rowing boat and a pair of paddles, belonging to two young boys. Due to its rather restricted size, the boat can only carry either the two boys together, or a single grown-up.

While the lieutenant - commander of the platoon - was trying to figure out the best way to organize the crossing, the radio received an urgent request: the captain wanted to know exactly how long the platoon would take to cross the river; ie how many minutes, or hours, or days were needed before the last man set his foot on the opposite bank of the river.

The lieutenant worked out that the boat, when carrying the two boys, would take 10 minutes to cross the river. One boy alone on the boat would need 5 minutes. One soldier - soldiers are not the best rowers - would take 8 minutes.

These calculations included the time taken by people to jump on board and get off the boat. After a few seconds, the officer, who had an above average IQ, sent the message with the answer to his captain.

How was the crossing organised, and how long did it take for the entire platoon to cross the river?

### General Manoeuvres Puzzle Solution

The manoeuvre was conducted this way:
1. The two boys cross to the opposite bank (10 mins)
2. One of them stays there while the other comes back (5 mins)
3. The boy gets off the boat, a soldier jumps on board and crosses the river (8 mins)
4. The soldier gets off, and the boat returns with the other boy (5 mins)
This operation required 28 minutes. The sequence had to be repeated as many times as the number of men in the platoon, ie 39 more times. However, it was needed to subtract 5 minutes from from the total: when the last man of the platoon crossed, the time (5 mins) taken by the second boy to cross back must not be counted, as the last soldier had already reached the other bank of the river.

The total time was therefore [(28 * 40) - 5] = 1115 minutes, which amounts to 18 hours and 35 minutes.

Mike Horan points out that it can be done faster if you leave both boys stranded on one side with the boat on the other. The first 39 soldiers cross at 28 minutes each (1092 minutes). You then have the two boys plus the last solider on one side. The final soldier then rows across himself, hence 1092 + 8 = 1100 minutes.

## Poker Results

Alice, Barbara, Claire, Daniel and Edward are discussing the result of the card game of the previous night.

Person #1 (woman): "Claire is single. The sisters and brothers all together totalled a loss of £9."

Person #2 (man): "My wife and I have lost a total of £1."

Person #3 (woman): "My sisters-in-law, all together, have lost £2."

Person #4 (man): "My brother-in-law and I have managed to lose £12 all together."

Person #5 (woman): "My result combined with that of Alice - who is Daniel's wife and an only child - is overall positive."

How much has each of them won or lost?

### Poker Results Puzzle Solution

The 5 people and their wins/losses are:

Person #1: Barbara (+ £4).
Person #2: Edward (- £5).
Person #3: Alice (+ £14).
Person #4: Daniel (- £7).
Person #5: Claire (- £6).

This result is obtained from the statements of the 5 people.
• Since the sisters-in-law (#1 and #5) lost, wile #5 and Alice have won, then #3 is Alice.
• Alice won £14, because £2 lost by the sister-in-law, and £12 lost by the men.
• #1 is Barbara, as she talks about Claire.
• Alice is the only child, therefore the sisters-in-law must be sisters of the husband (Daniel).
• Daniel lost £7, as the bunch of brothers and sisters have lost a total of £9, of which only £2 was lost by the sisters.
• Edward lost £5, as the two men lost a total of £12, of which £7 was lost by Daniel.
• Barbara - Edward's wife because Claire is single - won £4, as the total lost by the couple Barbara-Edward is £1.
• Claire lost £6, as the total loss of the two sisters is £2, but Barbara won £4.

## Snake

How are we to seat them within our only 8 remaining spaces?" frowned the manager of the theatre. Everyone was well aware of the problems of these eight people. They came as a group, but each person loathed one or two of the other people and could not stand to be near them.
The assistant manager gestured to the plan of seats remaining. "I have made eight counters to represent each of the people in this group. I have numbered them logically. Person 1 and 8 only hate 2 and 7 respectively. All the others hate the numbers on either side of them." He rubbed his chin in thought, "the only problem is how can we arrange them so that no-one is right next to anyone they hate?"

Place the counters 1 to 8 in the grey squares above such that no two consecutive counters are adjacent to one another horizontally, vertically nor diagonally.

### Snake Puzzle Solution

Counters 1 and 8 need to be in the middle since they each have only one number that they cannot be neighbours with. Hence 7 and 2 must go in the sidewings, and the rest is trivial.

 3 5 7 1 8 2 4 6

## Sunday, February 22, 2015

Consider the diagram below. Figure 1 shows four shapes. The same four shapes have been rearranged in Figure 2. However, there is now a gap, but none of the shapes have changed.

How can this be?