**Problem : “Wolf, Goat, Cabbage problem”s solution code in Java**

Hi!

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.

#### Solution: “Wolf, Goat, Cabbage problem”s solution code in Java

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

else

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.