Traveling Salesman Problem in Solid Grid Graphs

A solid grid graph is the vertex-edge graph of a finite simply connected union of unit grid cells. Given such a graph, find a shortest closed walk visiting every vertex, or determine the computational complexity of this optimization problem.