💡 Funky Chess Board

#1

i am unable to get correct ans
pls help me
my code

#2

pritika u r checking for a move only but u havr to check the best move or say best path for the knight so that the unvisited is minimum
here u have to backtrack to find the optimal path
and make an array of visited for the track and when u find a best path just traverse the visited array the position which is valid and not visited is the ans

#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.