From Heuristics

Jump to: navigation, search
thumb Introduction

Tiling is an art. Although most patterns are very regular (for instance square tiles in your kitchen or bathroom) there are also more ambitious patterns. For example a 'versailles-pattern' where two or three different tiles are arranged, often in a repeating pattern. In some rare cases the tiles are very irregular requiring the artist or architect to spend a lot of time to puzzle them together.

In this assignment you need to develop an algorithm to place sets of tiles of increasing difficulty.

Source Code Source code can be found on blackboard.


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.

Example Tileset

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

  • ~15 Tiles
  • ~25 Tiles
  • ~35 Tiles
  • ~45 Tiles
  • ~55 Tiles


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?

Personal tools