A farmer needs to transport a wolf, goat, and cabbage across a river using a boat that can only carry two items at a time. The wolf cannot be left with the goat, as it will eat it, and the goat cannot be left with the cabbage, as it will eat it. The document outlines the start state, safe states where moves are valid, how to make moves between states, and defines the terminal or goal state as having all items on the opposite side of the river in seven moves.

1. Welcome :)

2. Description
• Farmer want to travel wolf , goat and cabbage
to other side
• the boat can only carry , two farmer and
another one with him.
• Wolf eat goat , goat eat cabbage

3. Start Code
• sl([r,r,r,r],[]) mean goal state .
• sl([w,w,w,w],X) mean start state which mean that i
move all wolf, goat, cabbage to other side
• we start with list and then move to 4 direction then
check every direction if it safe then move to next
state .

4. Safe State
Determine if the move valid or invalid by the make the :
1. At least one goat or wolf on the same side with farmer .
2. At least one goat or cabbage with the same side with farmer .

5. Move

6. Move
check to move Wolf eat goat , goat eat cabbage and move
without anything (none), and changePos which check
to carry the (X) from the left to right or from right to
left .
and move(ListRight , (move's Item) , listLeft).
which i return (move's item), and i check all the possible
solution.

7. Terminal

8. Terminal
what is length :)
at first if you didn't write it the prolog will not
stop because it will try (goat ,
goat , ......)
so i want all possible solution with list X
which it have lenght 7 which is the
optimal solution.

9. Thank You
Sorry for any English mistake :)
blished by (@Sngv)
dnasser1993@gmail.com
ahmed_nasser93
ahmednasser9393

10. Thank You
Sorry for any English mistake :)
blished by (@Sngv)
dnasser1993@gmail.com
ahmed_nasser93
ahmednasser9393