Linear algorithm for solution n-Queens Completion problem

2019/12/05 by Grigoryan, E.
#Artificial Intelligence (cs.AI) #D.1.6 #D.2.4 #F.3.1 #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.1912.05935

Abstract

A linear algorithm is described for solving the n-Queens Completion problem for an arbitrary composition of k queens, consistently distributed on a chessboard of size n x n. Two important rules are used in the algorithm: a) the rule of sequential risk elimination for the entire system as a whole; b) the rule of formation of minimal damage in the given selection conditions. For any composition of k queens (1<= k

Related

• The n-queens completion problem
• Finding First and Most-Beautiful Queens by Integer Programming
• A lower bound for the n-queens problem
• Counting N Queens
• An Adaptive Genetic Algorithm for Solving N-Queens Problem