• Status: Solved
  • Priority: Medium
  • Security: Public
  • Views: 3822
  • Last Modified:

"Wolf, Goat, Cabbage problem"s solution code in Java

The problem is:
A farmer with his wolf, goat and cabbage come to the edge of a river they wish to cross. There is a boat at the river's edge. But, of course, only the farmer can row it. The boat also can carry only two things (including the rower) at a time. If the wolf is ever left alone with the goat, the wolf will eat the goat; similarly, if the goat is left alone with the cabbage, the goat will eat the cabbage. Devise a sequence of crossings of the river so that all four characters arrive safely on the other side of the river.

 I need source code which finds a solution to this problem in Java/C/Pascal/Basic.

3 Solutions
I don't know Java, but I can describe the way I'd solve this:

Write a function:
bool SolveFromHere( ListA, ListB, Side)
   if done, return TRUE
   MakeMove(ListA, ListB, Side)
   if SolveFromHere( ListA, ListB, Side )  
       return TRUE
       return FALSE

ListA is the items on the near bank, ListB is the items on the far bank, side is either N or F (Near or Far).

Test for done is when everything is in ListB.

A Move is placing the first item in the current side list on the end of the other side list, or just changing sides, while testing the criteria of what can or can't be together at the same time.  If the topmost call to SolveFromHere fails, permutation the order of the items and try again.   I'd have to work out the details of how to record the winning moves and how to insert the switch-sides-only type moves (without endlessly cycling back and forth with no passenger, etc.), but that would become clear after I coded the first part and stepped through it.

Brute force+recursive logic should get a good grade.
...I vaguely remember doing this exact problem in school...it was an exercise in understanding stacks....
Get your problem seen by more experts

Be seen. Boost your question’s priority for more expert views and faster solutions

step1--> take wolf and goat
step2 --> on return take wolf with
step3 -->now  take cabbage  and wolf

for this u must use stack
Can only take 1 item at a time (rower plus 1 item)


As DanRollins said your best bet in tackling this problem is to use recursion, atleast in Java and C, i am not familiar with the other two languages. The solution starts with moving the goat to the far side and then one of the other items, wolf/cabbage, but then you need to take the goat back to the starting side and you should be able to make it from there taking an item at a time. Hopefully that helps you get started. Let me know if something is unclear.  

ozgunyAuthor Commented:
I should make use of trees and Breadth-first Search or Depth-first Search.
I think I understood the solution, I'll build up a tree for every probability.
4 boolean variables or an bool array for farmer, wolf, goat, cabbage which marks near bank or far bank
Thanks everyone for your help!
Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.

Join & Write a Comment

Featured Post

Upgrade your Question Security!

Your question, your audience. Choose who sees your identity—and your question—with question security.

Tackle projects and never again get stuck behind a technical roadblock.
Join Now