Eulerian and Hamiltonian Graphs · Challenge problem

A $3\times3$ grid of $9$ offices sits in a square arrangement; a corridor connects two offices exactly when they share a wall (so each office connects only to its horizontal and vertical neighbors, not diagonally). How many Hamiltonian cycles (closed routes visiting every office exactly once) does this corridor network have?