Question 1

Given a state space with only irreversible actions/moves, \_\_\_\_\_\_\_\_\_\_ . In the Simulated Annealing algorithm, \_\_\_\_\_\_\_\_\_\_ . A boat, man, lion, goat and a basket of cabbage are on the left bank of a river. The boat can carry a man and one other item only (either a lion, goat or cabbage). When the man is not around, the goat will eat the cabbage and the lion will eat the goat.\ Model this problem as a state space search problem. A state is represented as LEFT/RIGHT, for example,\ 1\. NONE/BMLGC: nothing on the left bank and all are on the right bank. 2. LC/BMG: lion, cabbage are on the left bank, and a boat, man, goat are on the right bank. 3. G/BML: goat is on the left bank, and a boat, man, lion are on the right bank. 4. L/BM: lion is on the left bank, and a boat and man are on the right bank.\ The first two are safe states where nothing gets eaten, the last two are unsafe states where something gets eaten. When LGC is left alone, assume that the goat eats the cabbage, after that the lion eats the goat, so we will have less states to handle.\ A move (or action) in this state space stands for one trip across the river, where the man can go alone in the boat or take one item along with him.\ Starting from BMLGC/NONE, which of the following states (both safe and unsafe states) are reachable in exactly 3 moves, nothing more, nothing less. Avoid repeating states like a -\> b -\> a.