can u let me know what is wrong in my code and also what changes can we make to improve in it
K night problem
@sgdon142 You have to write a recursive solution and check each valid configuration of the knights . If the configuration is correct print the configuration and backtrack.
@sgdon142 You are just looping through the board which would not be able to see all the valid configuration. So please try using recursion.
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.
i am not able to understand the question can u eleborate it pliz.
@sgdon142 The question asks You to find the total number of ways such that k knights can be placed in a board and no knight is killing each other.
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.