Artifial intellignece

Note that all edges in this state space go in both directions. For a transition from to let ( , ) = max{0, Change in the number of missionaries on the start side of the river} Notice that change can be positive (number of missionaries on start size decrease) or negative (it increases). So for example change of the number of missionaries from state A to H is 3-2=1 and from H to A is 2-3=-1. Therefore (, ) = 1 while (, ) = max (0, 1) = 0. Define a cost of a transition (an edge in the state space) to be (, ) = 1 /1+(,) . Define also the heuristic for the problem to be () = Number of cannibals that need to move from start side to the goal side.

a. Describe the state space with Missionaries and Cannibals problem as a set of assignments that satisfy a set of constraints over variables: you need to give number of variables, domain of each variable and the set of constraints that must be satisfied

1. Given the state space of Missionaries and Cannibals problem below: 3rm ac boat boat 3c