where i am making misktake
Check the code of funcky chess board
@dkroy8790, I don’t know why no one took this doubt , whatever the case, you are making mistake in logic , you are traversing every path you can visit for the cordinate (r,c) but the question demands that you take path without visiting the same cell again , that means that you can’t go back to the same cell , so what you need to do is find the minimum number of cells that the knight can not reach under the constraint that the knight may not move to any square that is not on the board and cannot rest in any spot more than once . here i am trying to find the maximum number of squares knight can visit in one go and the i will subtract it with total number of cells
I have explained this concept in great detail , refer below :-
In case of any doubt feel free to ask 
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.