Logic puzzles – about old jacks and new coats


Here are some new puzzles:
1) Old jacks
(1) Leather jacks always become very old
(2) Old jacks turn brown
Which conclusion is valid?
a) All brown jacks are old
b) No old jack is blue
c) Some leather jacks are brown
d) None of the above
You can check your answer at solution 85

2) Dirty Pigs
(1) No dirty pig is fat;
(2) No meager pig is pink;
Which conclusion is valid?
a) All fat pigs are clean;
b) All dirty pigs are meager;
c) All pink pigs are fat;
d) All pink pigs are clean;
e) All of the above;
You can check your answer at solution 96

3) New coats
(1) No new coat of mine is not made of plastic;
(2) All plastic coats are closed with zips;
Which conclusions are valid?
a) All plastic coats are mine;
b) All zipped coats are mine;
c) All coats closed with zips are old;
d) All my new coats are closed with zips;
You can check your answer at solution 75

These puzzles are based on a mathematical concept called Sets, but you can solve them without this knowledge. Sets are now taught at all high schools in the Netherlands, and I suppose also in other countries. Some Googling on Venn diagrams and puzzles revealed little or no sites. This surprises me as it usually regarded as a good educational practice if students are also taught to apply their knowledge to practical problems, although this may depend on the preferred learning style of the student.

Puzzles of this type do have a history. One not so well know puzzle master from Victorian England is Charles Lutwidge Dodgson (1832 – 1898), better known as Lewis Carroll, author of children tales as Alice in Wonderland and Through the looking glass.

In his daily life he taught mathematics, and the story goes that Queen Victoria loved Alice in Wonderland so much that she wrote the author and asked for a copy of his next book. Charles felt honoured, and duly send her a copy of his next book – a treatise on a mathematical subject.

Charles was also an avid puzzle designer. In his books “Symbolic logic” and “The game of Logic”, later republished by Dover press, he devised an elaborate mechanism to solve set problems like those above. Modern mathematicians would use Venn diagrams to solve the same class of problems. Puzzles like these are somtimes called Soriteses.

Here are some examples of the type of puzzles you can find in his book:
4) Wasps
(1) All wasps are unfriendly
(2) All unfriendly creatures are unwelcome
What conclusion can be found?

The puzzles can be made slightly more complex by adding mote statements, by more types of objects that play a role, or by adding negatives. Here are some of his puzzles that comprise 3 statements:
5) Sane
(1) Everyone who is sane can do Logic
(2) No lunatics are fit to serve on a jury
(3) None of your sons can do Logic
What conclusion can be found?

6) Flowers
(1) Coloured flowers are always scented
(2) I dislike flowers that are not grown in the open air
(3) No flowers grown in the open air are colourless.
What conclusion can be found?

7) Showy talkers
(1) Showy talkers think too much of themselves;
(2) No really well informed people are bad company;
(3) People who think too much of themselves are not good company.
What conclusion can be found?
Lewis Carroll was thinking in terms of modern day sets, and made no secret of it. At the end of each puzzle, he added a note about what the Universe of discourse in that puzzle was, wand what sets needed to be considered. For example, in puzzle 4 this was:
Universe = persons; a=good company; b=really well-informed; c=show talkers; d=thinking too much of ones self;

It is of course possible to create puzzles in this vein with more statements. Here is one from Charles L. Dodgsons book with four statements:
8) Birds in the aviary
(1) No birds, except ostriches, are 9 feet high;
(2) There are no birds in this aviary that belong to any one but me;
(3) No ostrich lives on mince pies;
(4) I have no birds less than 9 feet high;
What conclusion can be found?

Dodgson constructed puzzles much more complex; his longest is made up of 10 statements:
9) Animals in the house
(1) The only animals in this house are cats;
(2) Every animal is suitable for a cat, that loves to gaze at the moon;
(3) When I detest an animal, I avoid it;
(4) No animals are carnivorous, unless they prowl at night;
(5) No cat fails to kill mice;
(6) No animals ever take to me, except what are in this house;
(7) Kangaroos are not suitable for pets;
(8) None but carnivora kill mice;
(9) I detest animals that do not take to me;
10) Animals, that prowl at night, always love to gaze at the moon.
What conclusion can be found?

Odd one out


 

A while ago I suggested an “odd one out” at the gbrainy group discussion, and was quickly reproached for overlooking a hasty made up example. No excuse of course, and the other was completely right.
While surfing around this week I encountered another odd one out at Tanyas blog, see the illustration above. No solution given this time, and rightfully so. You are welcome to comment your solution 🙂

As an illustration of the dangers of odd one out, I just did a bit of surfing, and found this one as part of an established IQ-test:
Ο pen
Ο paper
Ο pencil
Ο crayon
The answer given was “paper”, as paper is the medium on which we write or draw, while crayon, pen and pencil are devices with which we write or draw.
The answer could as well have been Crayon, because it is not an everyday object, or because it starts with a ‘p’.

Despite these apparent dangers, there are some nice puzzles to be created in this category, and I hope to get back to this topic in a later post.

Geometric patterns & Gbrainy


The illustration below comes from Gbrainy, a puzzle program distributed with Ubuntu linux.
My wife and I first discovered it on one of our holidays, when our son Piet-Jan had equipped an old laptop with Ubuntu linux. GBrainy gave us several evenings with much needed mental exercise. It features logic, calculation, memory and verbal puzzles and exercises. One of the puzzles was this one:
figures from gbrainy
I must admit it took me some time to figure it out, and you can check the solution.

Some logicians and mathematicians maintain that there are two ways of thinking: deductive and inductive. Deductive reasoning is the type of reasoning where you have all elements available, and your deductions involve logical reasoning, but the reasoning does not include anything new. One might say that your reasoning takes your from general to specific. An easy example: All cows are animals. Bella is a cow. Conclusion: Bella is an animal. Inductive reasoning goes the other way around: from special to general. In the puzzle above this type of reasoning is very clear: you start looking for what the commons properties in the figure are, and what letters can be associated with them. Finding the properties is the inductive part: you don’t know what the common properties are, and you have to discover them.

The puzzle made me thinking, and I designed several others, some of which I took the liberty to present them to the GBrainy group, others are presented here for the first time. Several of my fellow workers, such as Jan Zoomers, Jon Koeter, Michiel Matthijssen and Pieter Vuijk tested some of them, for which I am grateful to them.


(Give up? Don’t check the solution to soon).


(Give up? Don’t check the solution too soon).

What comes next?


In a previous post I mentioned inductive and deductive reasoning. One might say that in inductive reasoning all elements are known, while deductive logic tries to find the general underlying a pattern.

Famous game inventor Robert Abott designed a game “Eleusis” which is based on inductive reasoning, and though this is a blog on puzzles I hope to spend a future article on this game – there are sufficient similarities.

Another area where inductive reasoning is used, is in many IQ tests. Many of them have exercises consisting of a series of numbers, where the person taking the test is asked to find the next number. Patterns are usually purely based on elementary arithmetic.

Here are some exercises, ranging from elementary to difficult:
1) 3, 6, 9, …
2) 2, 6, 10, 14, …
3) 3, 12, 48, …
4) 19, 15, 11, …
5) 128, 64, 32, …
The sequences above are very simple, one operation is repeated again and again.

Things can however be made slightly more complicated, and this is the level you will find in many IQ tests.
6) 3, 6, 4, 8, 6, 12, 10, … (solution 41)
7) 3, 5, 8, 10, 13, 15, 18, .. (solution 51)
8 ) 3, 8, 3, 11, 3, 14, 3, .. (solution 7)
9) 100, 90, 180, 170, 340, 330, .. (solution 14)
10) 260, 130, 120, 60, 50, … (solution 20)
11) 15, 7, 22, 14, 29, 28, … (solution 28)
12) 18, 36, 13, 18, 8, 9, … (solution 35)
The nice thing about this type of puzzles is that after doing a series, you know the patterns to look for, which makes the next one easier to solve. As a result, you actually score higher when you consecutively take an IQ test where they have this kind of exercises. So yes, solving these puzzles actually makes you score higher at IQ tests.

13) 5, 11, 23, 47, … (solution 58)
14) 38, 22, 14, 10, … (solution 64)
15) 4, 12, 26, 54, … (solution 72)
16) 248, 86, 32, 14, … (solution 79)
17) 3, 4, 7, 11, … (solution 84)
18) 3, 6, 11, 18, … (solution 94)
19) 3, 7, 12, 18, 25, … (solution 104)
20) 3, 5, 9, 15, 25, … (solution 114)
21) 2, 5, 10, 17, 26, … (solution 124)
22) 3, 10, 29, … (solution 133)
23) 4, 8, 24, 96, 480, … (solution 142)

Occasionally, you will encounter sequences which will be posed in a different form, such as:
24) 5, 9, …, 17, …, …, 29. (solution 149)

25) One form occasionally used in puzzle books and magazines is the rectangle or square:

7 12 5
17 16 18
9 3 ..

(solution 156)

26) Puzzle magazines often love to add illustrations. That is nothing new, Sam Loyd in the 19th century added an illustration to almost any puzzle in his Encyclopedia of Puzzles. Here is an example as they might appear in puzzle magazines.
In the supermarket, you find several fruit bags with labels. Unfortunately, one of the labels is damaged. Can you figure out what the price on the damaged label is?

Should the puzzle beat you, you can look up the solution 37

Things can be taken too far. For example, take the next sequence:
1, 2, 4, 8, 16, 31, ….
No, the 31 is correct, it is not a typo for 32, it is really 31.

You may spend days thinking about this sequences and never find an answer. Unless you happen to have stumbled on the problem before, you are not likely to stumble on the solution, which is 57.
The logic behind this series is that it is the number of regions formed by joining points on a circle:

Further reading:
http://www.nextnumber.com
http://www.nextnumber.com/show?39

River crossings (4) – Bigamists


The puzzles in this post are extracted from the previous river crossing post, as that post grew too large. There is a common characteristic too these puzzles, though I find it hard to give an exact definition of this common property.

1) Bigamists
Back to the form of the puzzle with Jealous couples. M.G. Tarry has complicated the problem by assuming that the wives are unable to row. He also proposed a further complication by suggesting that one of the husbands is a bigamist traveling with both his wives.
Steven Kransz’s in his book: “Tecbniques of problem solving” gives a similar variation: “A group consists of two men, each with two wives, who want to cross a river in a boat that only holds two people. The jealous bigamists agree that no woman should be located either in the boat or on the river banks unless in the company of her husband.” That is how Miodrag Petković cites it in his book: Famous puzzles of great mathematicians. The latter condition makes it impossible to solve, and I guess that the latter condition should actually read “The jealous bigamists agree that no woman should be located either in the boat or on the river banks with the other man unless in the company of her husband.”
For the solution, see solution 121

2) A family affair
A recent addition tot his class of puzzles, which surfaced on the web as a flash game, is the following: A father and two sons, a mother with two daughters, and a thief guarded by a policeman want to cross a river. Their only means of transport is a raft able to carry 2 people. There are some problems:
• The Father is a rather nasty guy who will beat up the two girls if the mother is not present
• I regret to say that the Mother is equally nasty and will beat up the two boys unless the father is present
• The thief will beat up the boys, girls and adults if not accompanied by the police.
• Only the Father, the Mother and the Policeman know how to operate the raft
How many trips do you need to get them all across?
The site is in an Asian language, which suggests that the puzzle is of Chinese/Japanese or Korean origin. I welcome any information on the inventor of this puzzle. You can find it here.

You can find the solution at number 131

Actually this puzzle has a strong connection to both the elementary farmer-wolf-goat-cabbage puzzle and the bigamists puzzle.

3) The farmer, the kids and the pets.
Another recent flash based river crossing panel can be found at http://www.smart-kit.com/s888/river-crossing-puzzle-hard/>this site
The rules are simple:
A farmer, his son and daughter, and their pets need to cross a river. The pets are an aggressive dog, 2 hamsters, 2 rabbits. There is a small two-seater boat they can use. All 3 people know how to use the boat, but none of the animals can.

  1. If the farmer is not around, the aggressive dog will bite everyone and everything.
  2. If the daughter is not around, the son will tease the rabbits.
  3. If the son is not around, the daughter will tease the hamsters.
  4. The hamsters and rabbits get along fine with each other.

The solution is number 151

4 ) The two polygamists
Here is a new puzzle, which occurred to me while traveling by car today: Two polygamists, each accompanied by three wives, want to cross a river with a boat that can hold only 2 people at a time. The two men are so jealous, that they wont allow any of their wives to be in the boat, or on one of the riverbanks, with the other man unless he himself is present. An extra complication is that only one of the men, and one of his wives, can row.
How many crossings do they need?

You can find the solution at number 135

The bridges of Konigsberg


This time we make a side step from the previous series of river crossing puzzles. Where you had only a boat ion the previous series of puzzles, this time the only allowed way is to walk over bridges.

The bridges of Konigsberg is a classical mathematical problem solved by mathematician Leonard Euler.
The town of Konigsberg is situated along a river, with two islands in the middle, connected by 7 bridges. On Sunday afternoons, the inhabitants tried to make a walk in such a way that they crossed every bridge exactly once. No swimming or boats were allowed.
Konigsberg bridges
Euler proved that this was impossible, and his prove provided the base for what is now known as graph theory. His concept is simple to understand. He reduced the riverbanks and islands to dots, and the bridges to lines. It will be clear that if an intermediate dot has an uneven number of lines, this knot will have a problem: the walker should exit the dot as often as he enters it. Only at the start and at the end of the walk there can be a dot with an uneven number of lines.

The question of course arises: If it is impossible, and if the mathematics is clear, how can we still use it for puzzles?

Over the past two centuries a few puzzles have been invented. Here they are:

1) The monk
bridges in the monk puzzle
British puzzlemaster Dudeney reduced the problem to one island and five bridges. In this situation the bridges can all be crossed exactly once.
His problem is: If a monk want to start somewhere, in how many ways can he cross all bridges exactly once?
You can check your solution.

2) The two contractors

2a) The contractor on the northern shore.
The town had two important and rich contractors. One lived on the northern river bank, the other on the southern riverbank. The favorite Kneipe, or pub, of both was on the rightmost island with 5 bridges.
Hearing of Eulers method, the contractor on the northern riverbank decided to build an extra bridge at his own cost, which would allow him to start at his home, cross all bridges once, and end for a pint in his favorite pub.
Where did he build this bridge?
You can check your solution.

2b) The contractor on the southern shore.
When the contractor on the southern shore saw the new bridge, he realized that it was impossible for him to make a sunday afternoon trip and end in the same pub. He immediately decide to build an extra bridge at his own cost in such a way that he himself was able to start from his own home, cross all bridges exactly once, and end up in their favorite pub.
Where did he build this bridge?
You can check your solution.

2c) The mayor.
The mayor, seeing the two new bridges, called the two assembly together and decided to build a third new bridge, in such a way that all inhabitants of the town, no matter where they lived, could start from home, cross all bridges exactly once, and end up in the pub on the rightmost island.
Where did he build this bridge?
You can check your solution.

3) The pastor en the penitence
Here is a new puzzle for you:
A mayor with a good sense of history restored the bridges to the original situation at the time of Euler.
However, during one of the many wars in the region, one of the bridges was destroyed and rebuild at another spot. The new situation did allow the citizens to cross all bridges exactly once on their Sunday afternoon walks, provided they lived on either the northern or southern riverbank. See the following illustration:
The situation with one bridge rebuilt in the wrong place.
When one of his parochians confessed him the rather severe sin of eating 7 cakes on a single afternoon, the pastor – for this sin of gluttony – ordered him to make the Sunday afternoon from his home walks in all possible ways.

Starting on the southern riverbank, how many ways are there to cross all bridges exactly once?
You can check your solution.

River crossing (3) – couples


There is a third class of river crossing problems, which has the same old origin as those of the farmer crossing the river: the publication of medieval manuscript Propositiones ad Acuendos Juvenes, which is generally attributed to generally attributed to Abbott Alcuin.

The original puzzle was:
1) Three couples want to cross a river. The boat they have available is small and can hold only 2 people.
A complication is that the three men are extremely jealous, and don’t want any man or men to be with their wife on one of the two shores if he is not there himself.
How many trips does it take them to all get across the river?

This puzzle was described as “quite sexist” by David Singmaster in his lecture “The utility of recreational mathematics”. He made the statement during the Eugene Strens memorial conference on recreational mathematics and its history, the proceedings of which were written by Richard K. Guy, Robert E. Woodrow. Part of these proceedings can be read here:
http://books.google.nl/books?id=-4W_5ZISxpsC&pg=PA344&dq=puzzle+river+crossing&hl=nl&ei=3qdNTdntGo6WOp_2ieMP&sa=X&oi=book_result&ct=result&resnum=8&sqi=2&ved=0CFoQ6AEwBw#v=onepage&q=puzzle%20river%20crossing&f=false
I think it is sexist in the sense that the puzzle makes a difference between men and women, and that the men are depicted as jealous where the women are not described as such. But frankly I don’t see any discrimination in it in the sense that women are regarded as less than the men. Also, the roles can easily be reversed. The only discrimination aspect I could find in it is that the women do not protest against the jealousy of their husbands.

For the solution, see solution 101

There is a variation of this puzzle, usually termed “missionaries and Cannibals”.
2) 3 Missionaries and 3 Cannibals want to cross a river. There boat can hold only 2 people at any time. The missionaries do not have the courage to be a minority on either shore for fear of being eaten.
How many trips does it take them to all get across?
During the same lecture David Singmaster called this one racist. An understandable accusation, though the puzzle does not mention any race of the cannibals. They might as well be the inhabitants of a secret village in mid-Europe. It also does not mention any religion of the missionaries, they might be Christian, as most people probably will imply, but they might as well be Islamic, though the word misionary is usually associated with the first.

For the solution, see solution 91

3) Just two rowers
There is a version with a small additional constraint: Only one of the cannibals and all of the missionaries can row. I will not give the solution here.

4) A boat for three.
Dudeney comes up with an enlarged boat:
During certain local floods five married couples found themselves surrounded by water, and had to escape from their unpleasant position in a boat that would only hold three persons at a time. Every husband was so jealous that he would not allow his wife to be in the boat or on either bank with another man (or with other men) unless he was himself present. Show the quickest way of getting these five men and their wives across into safety.
Call the men A, B, C, D, E, and their respective wives a, b, c, d, e. To go over and return counts as two crossings. No tricks such as ropes, swimming, currents, etc., are permitted.
The problem of larger boats was later fully analyzed by a mathematician, whose name has eluded me.
You can find the solution at solution 111

5) The four elopements
Sam Loyd made a classic expansion, introducing an island. Dudeney came also up with this variation, which might be an indication that they both got it from a third source. Here the puzzle is presented in Dudeneys words:
Colonel B—— was a widower of a very taciturn disposition. His treatment of his four daughters was unusually severe, almost cruel, and they not unnaturally felt disposed to resent it. Being charming girls with every virtue and many accomplishments, it is not surprising that each had a fond admirer. But the father forbade the young men to call at his house, intercepted all letters, and placed his daughters under stricter supervision than ever. But love, which scorns locks and keys and garden walls, was equal to the occasion, and the four youths conspired together and planned a general elopement.
At the foot of the tennis lawn at the bottom of the garden ran the silver Thames, and one night, after the four girls had been safely conducted from a dormitory window to terra firma, they all crept softly down to the bank of the river, where a small boat belonging to the Colonel was moored. With this they proposed to cross to the opposite side and make their way to a lane where conveyances were waiting to carry them in their flight. Alas! here at the water’s brink their difficulties already began.
The young men were so extremely jealous that not one of them would allow his prospective bride to remain at any time in the company of another man, or men, unless he himself were present also. Now, the boat would only hold two persons, though it could, of course, be rowed by one, and it seemed impossible that the four couples would ever get across. But midway in the stream was a small island, and this seemed to present a way out of the difficulty, because a person or persons could be left there while the boat was rowed back or to the opposite shore. If they had been prepared for their difficulty they could have easily worked out a solution to the little poser at any other time. But they were now so hurried and excited in their flight that the confusion they soon got into was exceedingly amusing—or would have been to any one except themselves.
As a consequence they took twice as long and crossed the river twice as often as was really necessary. Meanwhile, the Colonel, who was a very light sleeper, thought he heard a splash of oars. He quickly raised the alarm among his household, and the young ladies were found to be missing. Somebody was sent to the police-station, and a number of officers soon aided in the pursuit of the fugitives, who, in consequence of that delay in crossing the river, were quickly overtaken. The four girls returned sadly to their homes, and afterwards broke off their engagements in disgust.
For a considerable time it was a mystery how the party of eight managed to cross the river in that little boat without any girl being ever left with a man, unless her betrothed was also present. The favourite method is to take eight counters or pieces of cardboard and mark them A, B, C, D, a, b, c, d, to represent the four men and their prospective brides, and carry them from one side of a table to the other in a matchbox (to represent the boat), a penny being placed in the middle of the table as the island.
Readers are now asked to find the quickest method of getting the party across the river. How many passages are necessary from land to land? By “land” is understood either shore or island. Though the boat would not necessarily call at the island every time of crossing, the possibility of its doing so must be provided for. For example, it would not do for a man to be alone in the boat (though it were understood that he intended merely to cross from one bank to the opposite one) if there happened to be a girl alone on the island other than the one to whom he was engaged.

7) Summer Tourists
Sam Loyd, as number 207 of his Cylopedia of Puzzles, comes up with a small variation:

As a preface to a very interesting problem which shows how a company of very quarrelsome picnickers might cross a stream in the same boat without upsetting it, I shall take for granted that all puzzlists, young and old, are familiar with the ingenious tactics of the boatman who had to ferry a fox, a goose and some corn across a river in a small boat “built for two”.
There is a German version of the story which tells of a peasant with a wolf, a goat and, I think a tomato can, which he was to get across the river in a way to circumvent the wolf’s love for goat meat, as well a the natural tendency of the tomato can to telescope into the goat. Eithe of the stories, a familiarly told, possesses interest for the juveniles, and when solved would strengthen a branch of the memory and reasoning powers not generally called into exercise. To a trained puzzlist the problem poses no problem whatsoever, but to one not versed in such matters, if he will just try to run the solution through his mind to test mentally just how many times the boat must cross the river, he will speedily realize what a valuable school it is for learning to concentrate the thoughts.
I wonder, however, if any of our readers who are familiar with both stories have chanced to realize what a funny state of affairs might arise if the two incidents were combined in one? That is a trick I often resort to when I have a couple of easy puzzles which are susceptible of being twisted together into one genuine poser.
Added by the accompanying picture, which explains the situation in a way that words would fail to do, we will tell the story of a party of tourists, who, returning from a picnic were compelled to cross a stream in a small boat, which would hold but two at a time, and none of the ladies could row.
It so happened that Parson Cinch, the popular coloured preacher, has quarreled with the other two gentlemen, and as a result Mrs. Cinch had a falling out with the other ladies.
How is it possible for the gentlemen to conduct them all across the stream in such a way that no two disagreeing parties shall ever cross over together or either remain on either side of the stream at the same time. Another curious feature of the strained relations being that no one gentlemen should remain on either side with two ladies.
The puzzle is merely to show how many times the little two seated boat must cross the stream, to ferry the entire party over; but I take occasion to say that not one person out of a thousand is endowed with a headpiece which would figure it out mentally, without recourse to pencil and paper, although the faculty of doing so may readily be acquired.

In the unlikely case that you are hopelessly lost, peek here.

8) The four elopements

Of course all good puzzlists are familiar with the time honoured problem of the countryman who had to ferry a fox, goose and some corn across a river in a boat which would carry but two at a time. The story of the four elopements, equally old, is built upon similar lines, but presents so many complications that the best or shortest answer seems to have been overlooked by mathematicians and writers upon the subject.
It is told that four men eloped with their sweethearts, but in carrying out their plan they were compelled to cross a stream in a boat which would hold only two at a time. It appears that the young men were so extremely jealous that not one of them would permit his prospective bride to remain at any time in the company of any other man or men unless he was also present.
Nor was any men to get in the boat alone, when there happened to be a girl alone or on the island or shore, other than the one to whom he was engaged. This feature of the condition looks as if the girls were also jealous and feared that their fellows would run off with the wrong girl if they got a chance. Well, be that as it may, the problem is to guess the quickest way to get the whole party across the river according to the conditions imposed. let us suppose the river is two hundred yards wide, with the island in the middle. How many trips would the boat make to get the four couples safely across in accordance with the stipulations?
Don’t spoil puzzle fun to quick by peeking at the solution

9) Four jealous couples and a picnic

It occurred to me that Sam Loyds puzzle with four couple and an island, described fully above, can be taken slightly further. Again we have four couples, a boat for 2 persons to cross the river, and an island.
Again the boys have that awful stroke of jealousy, which forbids them to let one of their friends to be with their girlfriend if he is not present himself.
But in addition, the girls have prepared a huge bag with food for the pick-nick. The bag is so heavy that it wont fit into the boat if it already holds two persons, it has to be ferried across by one person. The food smells so good that girls don’t allow the boys to be with the bag with food if not at least one girl is there to keep watch on the food.

You can find the solution at number 141

UPDATE 2016, December 17
Peter Rowlett ran an interesting discussion on the sexist nature of the three couples puzzle. One reformulation of the puzzle, which maintains the personal relationship aspect, is:
Three actors and their three agents want to cross a river in a boat that is capable of holding only two people at a time, with the constraint that no actor can be in the presence of another agent unless their own agent is also present, because each agent is worried their rivals will poach their client. How should they cross the river with the least amount of rowing?
The variation was suggested by James Summer.

River crossings(2)


The group of river crossing puzzles that I want to have a look at in this post is best characterized by its oldest specimen, that of the farmer, wolf, goat and cabbage. Chances are that you have a chicken instead of the goat, wheat instead of the cabbage or a fox instead of the wolf.

One form is:

1) a wolf, a goat and a cabbage*
A farmer bought a wolf, a goat and a cabbage at a market. On the way back home he has to cross a river. His small boat will hold, aside from him self, just one item.
If he leaves the wolf and the goat together, the wolf will eat the goat.
If he leaves the goat and the cabbage together, the goat will eat the cabbage.
How does he get everything across the river?
In all these puzzles there are no ropes, bridges or other tricks. Just play the ferryman.
You would disappoint me if you need a solution for this old traditional, but for the sake of completeness it is You can find the solution here

Like many river crossing problems it dates back the middle ages, and is found in the manuscript Propositiones ad Acuendos Juvenes, which is generally attributed to generally attributed to Abbott Alcuin.

The puzzle has been found in the folklore of African-Americans, Cameroon, the Cape Verde Islands, Denmark, Ethiopia, Ghana, Italy, Russia, Romania, Scotland, the Sudan, Uganda, Zambia, and Zimbabwe.[2], pp. 26–27;[7] It has been given the index number H506.3 in Stith Thompson’s motif index of folk literature, and is ATU 1579 in the Aarne-Thompson-Uther classification system.

In some parts of Africa, variations on the puzzle have been found in which the boat can carry two objects instead of only one. When the puzzle is weakened in this way it is possible to introduce the extra constraint that no two items, including A and C, can be left together.

2) One example of an extension with 4 items*
A farmer has to take a fox, chicken, caterpillar and crop of lettuce with his small ferry boat across a river. His small boat can hold 2 items aside from himself.
The fox would eat the chicken if they are left unattended.
The chicken would eat the caterpillar if left unattended
The caterpillar would eat the lettuce if unattended
How can he take everything across?
You can find the solution at here

That puzzle is rather simple, so we can easily expand it 1 item further:
3) 5 items*
A farmer has to take 5 items, a fox, chicken, spider, caterpillar and crop of lettuce with his small ferry boat across a river. His small boat can hold 2 items aside from himself.
The fox would eat the chicken if they are left unattended.
The chicken would eat the spider if left unattended
The spider would eat the caterpillar if left unattended
The caterpillar would eat the lettuce if unattended
How can he take everything across?
See Solution

As I told above, in Africa several regional variations have developed. Here is one 4) african variant*:
A young warrior returns to the village with a young lion, a young tiger and a young leopard. He must cross a small river, but his tiny canoe will only hold 2 items besides himself. Each of these animals will attack any of the others if left unattended. How can he take them all three across?
See Solution

There is a slightly more subtle way to extend the puzzle to 4 items. Serhiy Grabarchuk came up with this variation:
5) The fox, the goose, the grain, and the dog*
This time, the farmer has to transport a fox, a dog, a goose, and some grain across a river. He has a boat which can carry himself and either the fox, dog, goose, or grain. If the farmer isn’t present, the fox cannot be left with either the dog or the goose, or both. If need be, the goose can be left with the grain provided the dog is present because the dog will guard the grain and won’t eat the goose. Help the farmer cross the river.

(This puzzle is from The New Puzzle Classics by Serhiy Grabarchuk, Sterling publishing company, New York, 2005.)
The mouse, the elephant, the dog, and the cat

For yet another variation and a nice discussion of it, see The lettuce-fearing leviathan in the book A fine math you’ve got me into by Ian Stewart.
(the text above comes from http://www.mathfair.com/rvrcrossing.html).
You can look up the Solution

6) 2 wolves, a dog, a goat and a bag of grain
The may issue of Quantum also came with a small variation:*
A farmer was trying to cross a river in a boat which held him and two items. He had five items to transport to the other side: two wolves, a fierce dog, one goat and one bag of grain. When the farmer was not around, either wolf would eat the dog or the goat, the dog would eat the goat and the goat would eat the grain. How could the farmer transport all five items across the river?

You will find the solution as Solution 134

Some people at MIT took this puzzle type into space. The puzzles are all framed as characters from a cartoon science fiction series called Futurama.
Their puzzles are all placed in the future, with exotic names for stuff that, if you are not familiar with the series, you may find hard to remember. I prefer a translation into here-and-now things. Here we go, this is my contribution to the field:

7) 6 cargoes*
There are 6 cargoes to be transported over a river by boat from the southern to the northern shore.
The boat may hold 3 persons, including crew, and 1 cargo.
The ship starts at the southern shore.
The ship needs a 2 person crew. The only approved crew combinations are Bill and Bruce, and Lily + 1 other person.
The ship will make 6 trips to the northern bank and 6 trips back.
Not all persons and all cargo may be combined on the ship or on one of the river banks. See the conflict table below.
No one needs to leave the ship in order to pick up of drop of a cargo. Persons and cargo may be transferred simultaneously, so that a cargo is loaded on the ship while a person conflicting with the cargo disembarks at the same time, or vice verse.
At the end of the mission, all cargoes must have been transported to the northern shore. All persons must be back on the southern shore or on the ship.
There may be multiple crew combinations, but there is only one order in which the cargoes can be transported.
Starting positions:
Bill, Bruce and Lily: on the ship
On the northern shore: Alice, Mary, Peter, Quince.
All packages start on the southern shore.

Conflict table:

Goose Cheese Guitars Cardboard Bananas Radios Persons
Bill

X

X

Bruce

X

X

Lily

Quince

Alice

X

X

Mary

X

X

Peter

X

X

Quince

X

X

Lily

You can check the Solution 73

8) The pigs, peanuts and lilies*
the situation
You are at the planning desk of a small freighter cargo. Both John and Jack can handle the ship. Your transports are between Northport, Southport, and Island. The ship can handle either two persons or one person and one freight. The ship starts in Southport. And as you can guess, the ship needs at least one crew member.
a) Jack is on the ship in Southport. Jack is allergic for peanuts.
b) In Northport John is available. John is allergic for pigs.
c) In Northport there is a cargo of peanuts, which needs to go to the Island.
d) In Southport there is a cargo of pigs, which needs to go to Northport.
e) On the Island there is a cargo of lilies, which needs to go to Southport.

If someone is allergic to an object, he will not go ashore. He will go to a harbor with such a cargo, but will not leave the ship to pick up any cargo. Neither may, if a crewman is in a harbor, such a “toxic” cargo be dropped off in that harbor. There is only one gangway, so it is impossible that crewman A loads (resp. unloads) a cargo while crewman B, who is allergic to that cargo, leaves the ship (resp. boards it).
Roster the transports! What is the minimum number of shipments needed? It does not matter where the ship and the crew end.

River crossing (1)


There are many river crossing problems, and in this post I’d like to take a look at one of them. The basic of river crossing puzzles go back to the book Propositiones ad Acuendos Juvenes, probably published around 900AD.

In this first post on river crossing problems I’d like to take a look at a simple river crossing problem:
1) Man, wife and 2 kids*
A man and a woman of equal weight, together with their two children, each of half their weight, wish to cross a river using a boat which can only carry the weight of one adult.
How many trips do they need?

For the solution see Solution 4

Because this type of puzzle is so old, it has spread wide. Here is a Russian variant:
2) Three soldiers*
Three soldiers must cross a river. Two boys have a boat and are willing to help. Their small ferry can hold either the two boys or one soldier. How many moves are necessary to get all across?

For the solution see Solution 43

It is easy to see that the two boys can ferry an arbitrary number of soldiers across, the puzzle becomes in a way easier when the boys have to ferry 10 or 15 soldiers across, as the reader is forced to design a scheme to do it.
In fact, that is exactly what the famous British puzzle author Henry Dudeney (10 April 1857–23 April 1930) did when he formulated the puzzle as:
3) The British batallion*
During the Turkish stampede in Thrace, a small detachment found itself confronted by a wide and deep river. They discovered a boat with two rowing children. It was so small that it could hold only the two children, or one grown up person.
How did the officer get himself + his 537 soldiers across the river and leave the two children in possession of their boat? And how many times need the boat to pass from shore to shore?
Henry Dudeney published this puzzle ands Martin Gardner republished it in “536 puzzles & Curious problems”. I still wonder if there is any relation between the 536 and the 537.

For the solution see Solution 53

Dudeney also published this small variation:
4) The Softleigh family*
During a country ramble Mr. and Mrs. Softleigh found themselves in a pretty little dilemma. They had to cross a stream in a small boat which was capable of carrying only 150 lbs. weight. But Mr. Softleigh and his wife each weighed exactly 150 lbs., and each of their sons weighed 75 lbs. And then there was the dog, who could not be induced on any terms to swim. On the principle of “ladies first,” they at once sent Mrs. Softleigh over; but this was a stupid oversight, because she had to come back again with the boat, so nothing was gained by that operation. How did they all succeed in getting across? The reader will find it much easier than the Softleigh family did, for their greatest enemy could not have truthfully called them a brilliant quartette—while the dog was a perfect fool.

For the solution see Solution 63