Computer Science, asked by joeymaxxakaslo, 1 year ago

A witch has millet, a goat and hyena. She has to cross a river and there is a boat which can only carry her and one of millet, goat or hyena. She cannot carry two items across the river at time. If she leaves the goat with millet on either bank of the river, the goat will eat the millet likewise if she leaves the goat with the hyena, then the hyena will eat the goat. How can you help the witch cross the river safely?
a. Represent this problem as a decision tree with node representing the states of the problem after each boat transition. Show all the legal states and transitions from states corresponding to all legal operations. [5]
b. Using depth first search on the tree , illustrate how a solution can be found [5]
c. Represent solution to this problem as graph path

Answers

Answered by lovely6847
0
ह्व्क्ल्व्कह्ध्द्ककजशदhakalabshsh

joeymaxxakaslo: ??
Similar questions