The thesis represents a collection of solved problems concerned with covering planar shapes (mostly rectangles with integer sides) by tiles known as polyominoes (e.g., domi- noes, trominoes, tetrominoes, etc.). In most cases, the goal is to find a tiling or to prove that no such tiling exists. In more difficult problems, the task is to deduce conditions for the rectangle to be tileable by specified polyominoes. The last chapter is devoted to calcu- lating the number of all possible tilings of the specified rectangle.
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:335016 |
| Date | January 2014 |
| Creators | Dvořáková, Tereza |
| Contributors | Slavík, Antonín, Halas, Zdeněk |
| Source Sets | Czech ETDs |
| Language | Czech |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.002 seconds