Funky Chess Board Problem

#1

How to solve this problem

#2

@vivekpatel hey you have have to use recursion and backtracking and also take visited array for each index ,you will move in all directions and backtrack till you find the case where you can traverse maximum blocks. Also take care of current index whether they are in board limits or not,they should be within the board.

#3

what will the base case

#4

@vivekpatel hey in base you will take the board contraints ,suppose current index is out of board limits or current value of board index is 0 then you will return only.

 if(i<0 || i>=10 || j<0 || j>=10 || board[i][j] == 0)
        return;
#5

I can’t understand how to solve this problem tell me how to solve this problem in steps

#6

@vivekpatel hi,check this commented code and dry run it you will get it:

#7

I think you have sent me different code

#8

@vivekpatel hey sorry ,here is correct code:

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