A square is subdivided into K2 equal smaller squares. We are given a broken line which passes through the centres of all the smaller squares (such a broken line may intersect itself). Find the minimum number of links in this broken line.(A Andjans, Riga) minimumbroken lineSquarescombinatorial geometrygeometry