Question 28
Dung draws a closed path on a 5 × 6 square-cell grid, using eight diagonals of 1 × 2 rectangles as shown. What is the greatest possible number of such diagonals in a closed path with no crossings and no revisited vertex?


MYTS · MYTS 2016 - Grade 6 - Round 1
