Problem #PRU-100206

Problems Discrete Mathematics Combinatorics Dissections, partitions, covers and tilings Tilings with ordinary and domino tiles

Problem

It is known that it is possible to cover the plane with any cube’s net. (You will see it in the film that will be shown at the end of this session). But Robinson, unfortunately, lived on an uninhabited island in the 19th century, and did not know about the film. Try to help him to figure out how to cover the plane with nets \(\#2\), \(\#6\), and \(\#8\) from the previous exercise.