laura-ham / tilingproject Goto Github PK
View Code? Open in Web Editor NEWFor the course 'Heuristics' at the VU Amsterdam we designed three algorithms with different heuristics, in order to determine a better constructive algorithm to solve the tiling problem. The tiling problem consists of a given set of fields, with each their own specific set of tiles, where each field needs to be solved by placing each tile on the field in such way that the whole field is covered and there is no overlap amongst the tiles.