$n$ vehicles occupy squares $(1,1)$ through $(n,1)$ (i.e., the bottom row) of an $n\times n$ grid. The vehicles must be moved to the top row but in reverse order; so the vehicle $i$ that starts in $(i,1)$ must end up in $(ni+1,n)$. On each time step, every one of the $n$ vehicles can move one square up, down, left, or right, or stay put; but if a vehicle stays put, one other adjacent vehicle (but not more than one) can hop over it. Two vehicles cannot occupy the same square.

Calculate the size of the state space as a function of $n$.

Calculate the branching factor as a function of $n$.

Suppose that vehicle $i$ is at $(x_i,y_i)$; write a nontrivial admissible heuristic $h_i$ for the number of moves it will require to get to its goal location $(ni+1,n)$, assuming no other vehicles are on the grid.

Which of the following heuristics are admissible for the problem of moving all $n$ vehicles to their destinations? Explain.

$\sum_{i= 1}^{n} h_i$.

$\max{h_1,\ldots,h_n}$.

$\min{h_1,\ldots,h_n}$.
