N missionaries and > 3 cannibals are on one side of a river, along with a boat that can hold at most = 2 people, where 1 < 2 . Find a way to get everyone to the other side without ever leaving a group of missionaries in one place outnumbered by the cannibals in that place. Define the problem in terms of state space, transitions between them, initial state and goal. Consider only those constraints and effects that are necessary to ensure a valid solution.

Artificial Intelligence Problem