How is this problem different from the actual knights tour problem??
What do we have to do in this question??
Funky chess board
Hello @mkidwai74 you know how knight move on the chess board.
so you have to find the number of boxes that a knight cannot visite.
it is much more simple question then the knight tours problem.
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.