Solved

puzzle questions

Posted on 2008-09-29
9
580 Views
Last Modified: 2012-05-05
A man (M), wolf (W), goat (G) and cabbage (C) are on the left bank of a river. There is a boat large enough to carry
the man and only one of the other three. The man wishes to ferry everyone to the right river bank, and the man can
ferry each across, one at a time.
However, if the man leaves the wolf and goat unattended on either shore, the goat is history. Similarly the goat and
cabbage cannot be left unattended by the man.

How can the man bring all those animals to the other river bank safely using the shortest way possible?
0
Comment
Question by:kuntilanak
[X]
Welcome to Experts Exchange

Add your voice to the tech community where 5M+ people just like you are talking about what matters.

  • Help others & share knowledge
  • Earn cash & points
  • Learn & ask questions
9 Comments
 
LVL 45

Expert Comment

by:sunnycoder
ID: 22602566
Hello kuntilanak,

man take goat
comes back
takes wolf
brings goat back
take cabbage
comes back
takes goat

Regards,

sunnycoder
0
 

Author Comment

by:kuntilanak
ID: 22602587
hey it's you again, thanks for helping since you're quite familiar with dfa/nfa.. I want to practice and put this into a transition diagram.

The start state is labeled MWGC | 0

0 = empty set

and input set will be soemthing like:

g (rows across with the goat), c (rows accross with the cabbage)

example when given an input gm

MWGC|0 -> WC|MG -> MWC|G

Any hints?

0
 
LVL 45

Expert Comment

by:sunnycoder
ID: 22602600
>example when given an input gm
>MWGC|0 -> WC|MG -> MWC|G
>Any hints?
You drew first three states correctly ... translate rest of the steps into your state diagram
0
What does it mean to be "Always On"?

Is your cloud always on? With an Always On cloud you won't have to worry about downtime for maintenance or software application code updates, ensuring that your bottom line isn't affected.

 
LVL 84

Expert Comment

by:ozo
ID: 22602609
MWGC|0 -> WC|MG -> MWC|G -> W|MCG -> MW|MGC -> 0|MWCG
0
 
LVL 45

Accepted Solution

by:
sunnycoder earned 500 total points
ID: 22602633
>MW|MGC
Thats does not look correct ... man cant be in two places at one time

MWGC|0 -> WC|MG -> MWC|G -> C|MWG -> MGC|W -> G|MWC -> MG|WC -> 0|MWGC
0
 

Author Comment

by:kuntilanak
ID: 22602638
so there's 6 states in this problem, and I just draw 6 circles with arrows connecting to each (input) other?
0
 

Author Comment

by:kuntilanak
ID: 22602642
oh and I just realized that ozo's solution has a shorter path :)
0
 
LVL 19

Expert Comment

by:Rob Hutchinson
ID: 22606239
Actually, there is an easier solution. Just use a tranquilizer gun on both the goat and the wolf, then take them over one at a time...faster too.
0
 

Author Comment

by:kuntilanak
ID: 22606281
haha..yea, that's a killers solution.. oh and if I were asked to draw a transition diagram of this situation.. what would it be like?
0

Featured Post

Industry Leaders: We Want Your Opinion!

We value your feedback.

Take our survey and automatically be enter to win anyone of the following:
Yeti Cooler, Amazon eGift Card, and Movie eGift Card!

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Article by: Nicole
This is a research brief on the potential colonization of humans on Mars.
When we purchase storage, we typically are advertised storage of 500GB, 1TB, 2TB and so on. However, when you actually install it into your computer, your 500GB HDD will actually show up as 465GB. Why? It has to do with the way people and computers…
This is a video describing the growing solar energy use in Utah. This is a topic that greatly interests me and so I decided to produce a video about it.
Finds all prime numbers in a range requested and places them in a public primes() array. I've demostrated a template size of 30 (2 * 3 * 5) but larger templates can be built such 210  (2 * 3 * 5 * 7) or 2310  (2 * 3 * 5 * 7 * 11). The larger templa‚Ķ

626 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question