Funky Chess Board

what will be the base case in recursion??

@Debugger This is a simple bfs problem. Just run a bfs loop in your function and check which all places can the knight go .