Here how we will decide the path of the knight

[be10046.19 (Vivek jha)]

means how we will decide whether it will go (r+2,c+1) or (r+1,c+2)

[O17LPOLA020023 (Abhijeet Jha)]

@be10046.19, you need to traverse every possible path and then select the longest path , greedy approach will not work here , you can use backtracking for this purpose,

refer below discussion for detailed explanation of the code, make sure you have done n-queens and rat-in-a-maze problem ,then it will be easier for you to understand below solution

Funky Chess Code Explanation

basically what your goal is to traverse different paths and find the longest path , you are keeping track of path visited by setting board[i][j] = 0 , you need to backtrack because if you don’t then you wouldn’t be able to traverse the cells that may have been before in some iterations , this might be little confusing to understand, the reasoning for using backtracking in this question is same as in rat in a maze, or n queen problem If you have’nt done these problem then i would suggest you to …

[be10046.19 (Vivek jha)]

thanks bhaiya very well explained my only confusion was those 8 function calls thanks for clearing my confusion

[be10046.19 (Vivek jha)]

bhaiya do the order of calling functions for different ways make any difference

[chhavibansal]

@be10046.19

calling functions for different ways make any difference

no there is no difference
u can call the 8 functions in any order