Funky chess board problem

#1

i didn’t understood the logic of modified chess board

#2

You are given a modified chess board and the starting position of the knight is the top left square. A knight can do 8 possible moves from a position if the resulting square lies inside the given board.
At the end, you have tell the number of squares that cannot be reached with any possible move.
For example, in 3x3 board, you cannot reach the middle position (1,1) starting from (0,0) the top left square.
You can take a boolean 2D array and check the visited squares by 8 possible moves.
Did you get it now?

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.