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 ...

Tiling problems involve dividing a given grid into smaller tiles or patterns in various ways. This project provides a visual representation of tiling solutions by employing a recursive algorithm.