Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

There are 3 men and 3 girls. lets name them ABC, A's daughter X, B's Daughter Y, C's daughter Z.

Rule to cross the river:

  1. At once Only two Can go on boat.
  2. Only Men know how to drive the boat (So there has to be atleast one man on boat)
  3. No girl crosses river with strange man, (that means, only father can take a girl on boat)
  4. No girl stays with strange men on shore, (that means, father should not leave his daughter with other men, either she should be alone, or with other girls or with her father)

How do they cross river?

share|improve this question

2 Answers 2

up vote 15 down vote accepted
  • A and X cross the river, X stays, A rows back
  • B and Y cross the river, Y stays, B rows back
  • A and B cross the river, A stays, B and Y row back
  • B and C cross the river, B stays, C rows back
  • C and Z cross the river, both stay, B rows back
  • B and Y cross the river.
share|improve this answer
    
Thank you .. it solved. –  InfantPro'Aravind' Nov 3 '12 at 10:59
    
Sounds like the Tower of Henoi puzzle. –  Sukima Nov 3 '12 at 17:12
    
@Sukima, quite dissimilar isn't it :) –  InfantPro'Aravind' Nov 4 '12 at 11:27

I assume that the boat can only carry two persons, otherwise there is not much of a puzzle.

Martini has given the natural and obvious solution. The weakness of this solution is that in the second step, A can do nothing to prevent B from stepping ashore and ravish X.

The original version of this problem, posed by Alcuin of York (teacher of Charlemagne) more than 1200 years ago, is slightly different. There three men are travelling with their sisters, and each man desires the other girls. The question is how to cross the river without any girl being defiled. Martini's solution is not permitted, but the girls are able to row.

A mathematical method to solve problems of this kind is to look for paths in graphs. Each permissible distribution of people among the various places is a node in the graph, and two nodes are connected by an edge if it is possible to get from one node to the other with one boat trip. A solution of the problem is a path from a start node to an end node. There are simple and effective algorithms for finding paths in graphs, which makes it feasible to solve problems of this kind with hundreds of constraints.

share|improve this answer
3  
Another variant (Italian I think) relaxes constraint 3 to allow the case where the man won't ravish someone's sister if his sister is also present as a chaperone) –  Foon Nov 3 '12 at 14:27
    
Corrected the question. –  InfantPro'Aravind' Nov 4 '12 at 11:25

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.