# Tiling

### From Heuristics

**Assignment**

Create an algorithm which fills a given field using given tiles so they fit perfectly. Placement of tiles is correct if there is no space between tiles and they do not overlap. Tiles in the given sets may not be oriented correctly.

The sourcecode includes 100 tilesets of differente sizes divided into 5 categories:

- ~15 Tiles
- ~25 Tiles
- ~35 Tiles
- ~45 Tiles
- ~55 Tiles

**Advanced**

The source also includes a generator to create more tilesets.

Use the assignment generator to generate more TileSets with different settings and try to answer the following questions.

- Which tilesets are difficult to solve?
- Which tilesets are easy to solve?
- What do the difficult / easy tilesets have in common?