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?
Answer:​

Answer 1

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?

Answer:

Step-by-step explanation:

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?

Answer: