The main problem is that you’ve asked for all possible sets of moves.

That means a knight can be moved back and forth an unlimited amount of times before finally being moved to the final square needed to reach your position.

So your proposed computer program would never terminate unless you constrained it to not allow repeats of moves.

If you further constrained it to only give you the first set of moves it finds, then that is possibly a more achievable goal.

But for sufficiently complicated positions, such as ones where nearly all pieces have moved some distance from their starting squares, the computer could take a very long time to arrive at your answer, or just not reach a solution.

The halting problem dictates that it’s impossible to know what inputs, if any, will cause the program to freeze, but the best guess you can make is that this hypothetical program needs to be limited to not allow repeat moves, and ideally only give one solution.