From last years exam:
The following is a problem which can be solved using state-space
search techniques:
``A farmer with his dog, rabbit and lettuce come to the east
side of a river they wish to cross. There is a boat at the rivers
edge, but of course only the farmer can row. The boat can only
hold two htings (including the rower) at any one time. If the
dog is ever left alone with the rabbit, the dog will eat it.
Similarly if the rabbit is ever left alone with the lettuce, the
rabbit will eat it. How can the farmer get across the river so that
all four characters arrive safely on the other side?''
Formalise the above problemin terms of state-space search. You should: