ericgrig/Completion-n-Queens-Problem

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

1 best points · 2 comments · 1 Hacker News post · 1 GitHub stars · View on GitHub

Hacker News discussions

• Linear Algorithm for Solution N-Queens Completion Problem- Source Code (1 points, 2 comments, by ericgrig, 2021-03-05)