in this code,i have taken number of unvisited positions as count and it is the number of 1;s when no other possible movement is possible…here i am just left with storing count for various cases in array and finding the minimum and printing it…what is to be done???modifications required?
Funky chess board
@Vibhuti0206
Kindly fix the compilation errors first and share your code again. Apart from that some of the things that I could notice were that you have not backtracked in your code which is something that will give you incorrect results.
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.