The aim of this assignment is to become more practical and maintained with the Java programming language. The problem itself is not too difficult but completing this problem in Java will familiarize you with the Java syntax. In this assignment the N-Knight's problem must attempts to move around the chess board so that the Knights must visits the maximum number of board positions without attacking each other. You are asked to write a Java program that can allocate the knights on the chess board based on the following conditions: 1- The Knight can move in the shape of the letter, 'L', over two in one direction and then over one in a perpendicular direction. 2- If the Knight rests at the square marked X. 3- The board is represented by an 8-by-8 two-dimensional array. 4- The Knights can be placed on the board as specified above so that no two Knights are attacking each other. You program should be well documented, and you should turn in the following in hard copy: 1- An external documentation describing the knight formulation, the program structure, global variables, the function/procedure to compute the heuristic function, and other functions/procedures, etc. 2- your program source codes (with necessary comments); 3- The execution results printed in a hard copy as required above as well as a soft copy must be presented.