Backtracking and other forms of heuristic search may help you solve the N-queens issue, but it is a difficult problem to solve. In this piece of research, genetic algorithms (GA) are used in order to tackle the issue in a way that is both straightforward and time-effective. In this study, the N-queen framework is discussed utilizing an improved GA technique. The N-queen framework is only an extended form of the eight-queen problem. The N-Queen problem is a well-known traditional puzzle. In this puzzle, a particular number of queens are required to be positioned on a N × N matrix in such a way that none of them may assault some additional queens. The queens in chess are able to launch attacks on any plane, including the horizontal, the vertical, and the diagonal. For the purpose of resolving the N-Queen framework, an evolutionary algorithm known as GA has been applied in this study. The N-Queen framework is solved using the modified genetic algorithm that has been developed. The outcome of the proposed technique that is provided is superior to the algorithms that are already in use.