Click a square to make it the missing (deficient) square, then Auto Solve to watch the classic recursive tiling.
Pick a missing square…
center trominoes mark subproblem splits
Placed: 0 trominoes
Rules: A 2ⁿ×2ⁿ board with one missing square can be tiled perfectly by L-trominoes. The solver places one central L to create four smaller deficient boards, then recurses.