In python code

Find out the proof and put your proof from Problem 24 into action. Consider an empty nn chessboard where n4. Let (x,y) represent the location of a square on the chessboard. In the above image, K is in the square located at (4,4). Define a function knight(n, x0, y0, xf, yf) in Python which shows (as a list of locations) how to move a knight from any initial location (x0, y0) to some final location (xf, yf).

problem 24:

In the game of chess, a knight moves by jumping to a square that is two units away in one direction and one unit away in another. For example, in the following figure, the knight at K can move to any of the squares marked with an asterisk *. Prove by induction that a knight can move from any square to any other square on an nn chessboard via a sequence of moves, for all n4.

For example:

knight(8, 1, 1, 4, 2) 

gives a possible output of:

[(3,1), (2,5), (1,2)]