Deterministic methods for solving the N_Queens problem, a strategy for proving p=np

Computational Complexity theory (NP) is a branch of the Theory of Computation, mathematics, and computer science that deals with the difficulty of solving problems algorithmically. This research is trying to focus on one of the representative problems of artificial intelligence called N_Queens by presenting some suggested ideas to help solve the np_complete problems to find the above algorithmic structure with high speed by providing suitable algorithms to solve the N-Queens problem. In the N-Queens problem, the goal is to place chess queens on an n×n chessboard so that no two queens are on the same row, column, or diagonal. The N-Queens Completion problem is a variant, dating to 1850. This technique can most likely be used to solve the intractable problems of artificial intelligence. The n-Queens puzzle is similar to another problem called the P versus NP problem in computer science. All well-known intractable problems that are very practical and important can be solved by solving P=NP.