We consider strongly connected orientations of the grid graph which has n1 + 1 east-west avenues and n2 + 1 north-south streets. We seek optimal strongly connected orientations according to several different definitions of optimality. In earlier work, such optimal orientations were found for n1, n2 both at least 4, and for n1 = 1 and n1 = 2. Here we consider the remaining case, n1 = 3.