Funcky chess Board Hint

#1

Hi, can anyone give some hint how to tackle this problem?? i am stuck in it and unable to figure out how to solve it. plz kindly explain the sample test case also as i am not getting it…

#2

Hi @akansha2603,This problem can be done using recursion.Once you visit a cell, then visit all the cells that can be visited from this cell like that given in the question (various positions where the knight can go) and also visit the cells that can be further visited from the next reachable cells.

#3

Hi can you explain by giving an example???

#4

Hi mam @cutiecoder can u plz explain by giving an example i am still unclear what to do in this question…

#5

See you are given the board in the input and now you will go to every possible path where the knight can go through recursion and keep on updating a variable count to keep the count of all the possible places where the knight can go and in the end you will print the total number of boxes on the board -(minus) count of the boxes where the knight can be placed.

#6


i have written the code and passing sample test case but mam i am getting
test case 1 &3:WA, test case 2:RE .
plz…kindly help where my code is wrong.

#7

i have written the code and passing sample test case but mam i am getting
test case 1 &3:WA, test case 2:RE .
plz…kindly help where my code is wrong.

#8

@cutiecoder, i have written the code and passing sample test case but mam i am getting
test case 1 &3:WA, test case 2:RE .
plz…kindly help where my code is wrong

#9

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.