Tiling Problem – Divide and Conquer
This project consisted in the development of a program that uses the Divide and Conquer algorithm to solve the following problem:
Given a n by n board where n is of form 2k where k >= 1 (Basically n is a power of 2 with minimum value as 2). The board has one missing cell (of size 1 x 1). Fill the board using L shaped tiles. A L shaped tile is a 2 x 2 square with one cell of size 1×1 missing.
