MathDB
TOT 068 1984 Autumn Train J2 3x3 square village, smallest distance

Source:

August 24, 2019
squaredistanceminimumcombinatorial geometrygeometry

Problem Statement

A village is constructed in the form of a square, consisting of 99 blocks , each of side length \ell, in a 3×33 \times 3 formation . Each block is bounded by a bitumen road . If we commence at a corner of the village, what is the smallest distance we must travel along bitumen roads , if we are to pass along each section of bitumen road at least once and finish at the same corner?
(Muscovite folklore)