Not able to understand the base case

#1

Not able to understand the base case. How will we get to know when to end for the sample test case…I have idea how to fill 8* 8 chess board with knight completely. Please explain completely

#2

@piyush.bansal8158625 this is a simple bfs problem. Try implementing it with queue.

#3

can you explain it with a sample test case how to use queue

#4

@piyush.bansal8158625 See you have to see that a knight moves in L direction in 8 different sides. So of a knight is at x,y it can go to x+1,y+2 , x+1, y-2 similarly 6 other positions and then just check if that point is within the board or outside and similarly make your decision.

#5

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.