opttile

# opttile - Optimum Tiling Problem - - - This problem is a...

This preview shows pages 1–2. Sign up to view the full content.

Sheet1 Page 1 Optimum Tiling Problem ------- ------ ------- This problem is a harder variant of the Tiling Problem (short name `tile'). You must read that problem before reading this problem. It is intended that you will code the `tile' problem before you code this problem, and use the `tile' code in the solution to this problem, but there is no requirement that you do this. By a placement of tiles we mean an order in which the algorithm of the `tile' problem tries to place the tiles. A placement can be labeled by giving the names of the tiles in the order of the placement. The `tile' problem only tries one placement, the placement ABC. .. in which the tiles are tried in order of their names. In this problem you are asked to find a placement that `works', in the sense that all tiles can actually be placed, and none are ignored. There may be more than one such placement. For example, if there are just two tiles and the placement AB works, then so will the placement BA. You are asked to find

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## opttile - Optimum Tiling Problem - - - This problem is a...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online