A carpark is arranged in a 4x4 grid and has a single entry/exit as shown in the diagram. A car has the size of a single cell of the grid. Cars can move through adjacent empty cells of the carpark either horizontally or vertically, but not diagonally. Cars cannot move outside the car park, except at the entry/exit cell. Can you place 9 cars in this carpark such that every car has a path to the exit?
I think this arrangement would work (red cells are those occupied by cars)
Other possible solutions
In the solution given, in the bottom left-hand corner I can move either car adjacent to the corner cell into the corner and still produce a valid solution. Also, I can reflect the whole diagram horizontally in all three cases and still produce a valid solution or I can rotate each solution anti-clockwise through a right angle and produce a valid solution.
And here is another way
Furthermore, we can slightly edit that solution to generate another (which is diagonally symmetric as suggested by loopy walt in the comments)