//by bell // every position is denoted by a unique string length made up of the sums of 4 strings. /* Challenge: Wolf, goat and cabbage by László Ozsvárt You have a wolf, goat and a cabbage (don't ask why and how yu got them) and you want to cross the river using a boat. The boat can carry you and up to one of your companions. You can't leave the goat alone with neither the wolf nor the cabbage (otherwise something will get eaten). How do you cross the river? Your task is to write a program that can solve this well known riddle with a twist: the starting position should be given as an input to the program. Example inputs: wgcb| The wolf (w), goat (g), cabbage (c) and the boat (b) (including you) are all on the left side of the river The pipe (|) symbol separates the two sides of the river. wgb|c The wolf, goat and boat are on the left side of the river and the cabbage is on the right side Output: The output should show the steps to get everything to the right side if possible. Your program should check also if there is a solution possible at all. You are free to choose how you want to visualize it. if(field.find("W S")!=string::npos||field.find("S W")!=string::npos){ }*/ #include #include #include using namespace std; int main() { string field, c=" Col ", s=" Sheep ",w=" Wolf ",m=" l_Me_// ", sea="|~~-~^~-~^|"; //1- set up the field, combinations of numbers 5, 7, 8 and 9 give different sums cout<<"Random starting position:"<

WolfGoatCabbage