Heuristic search A farmer needs to move a hen, a fox, and a bushel of grain from the left side of the river to the right using a raft. The farmer can take o ne item at a time (hen, fox, or bushel of grain) using the raft. The h en cannot be left alone with the grain, or it will eat the grain. The fox cannot be left alone with the hen, or it will eat the hen. For ex ample, the farmer cannot move from one side x of the river to the other side y if it would mean leaving the fox and hen together on side x. The farmer can load an item onto the raft, move the raft from o ne side of the river to the other, or unload an item from the raft. The farmer wants to move the items with the fewest number of tri ps across the river as possible, but does not care about how much ti me is spent loading or unloading. 1. Classify this problem using the primary representational dimen sions from lecture 2.(02课件-RepresentationalDimensions） 2. Represent this problem as a graph sea
