Determine the complexity of a shortest closed walk visiting every vertex of a solid planar grid graph. Vertices are lattice points, all unit-distance edges are included, the graph has no holes, and lengths are measured by its graph distances; repeated vertices are allowed.