![]() |
need help!
i need algorithm of L shape tiling problem in which we have to take n*n array then colour one box and fill the empty boxes with the L shape tile in a way that the tile shouldnt overlap the other and no box is left empty.
if someone knws plz email me at cancerian_isma@yahoo.com |
| All times are GMT +5.5. The time now is 23:34. |