## You have an NxN chessboard where N is a power of 2 (N = 2x where x is any positive integer). You are given L shaped blocks, each o

Question

You have an NxN chessboard where N is a power of 2 (N = 2x where x is any positive integer). You are given L shaped blocks, each one covers 3 tiles (Like the path taken by knights in chess). You have to cover the maximum area of the chessboard with these blocks. How many tiles will be left uncovered?

in progress
0

Mathematics
2 years
2021-07-15T14:21:33+00:00
2021-07-15T14:21:33+00:00 1 Answers
0 views
0
## Answers ( )

## Answer

You have an NxN chessboard where N is a power of 2 (N = 2x where x is any positive integer). You are given L shaped blocks, each one covers 3 tiles (Like the path taken by knights in chess). You have to cover the maximum area of the chessboard with these blocks. How many tiles will be left uncovered?