Four knights are placed on a $33$ chessboard: two white knights occupy the bottom corners $($a$1$ and c$1),$ and two $.$black knights occupy the top corners $($a$3$ and c$3)$

We need to apply a Genetic Algorithm $($GA$)$ to determine the sequence of moves required to rearrange the knights $..$into the final configuration shown in the figure

$.$Remember that knights move in an L$-$shape

:Instructions

This is a team work assignment with maximum $2$ students

Submit a PDF file that contains the students names and numbers

:and answers the following questions

$?$What is the representation of a chromosome, and what is its length? Why $.1$

$.$Give an example of two parents and their children after crossover. Explain $.2$

$.$Give an example of a chromosome before and after mutation. Explain $.3$

Write a detailed C$++$ code for the fitness function. Explain how it works $.4$

:Bonus

$.$Answer the questions $1-4,$ but we need the GA to find the shortest sequence of moves