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 queens (1<= k<n), a solution is provided, or a decision is made that this composition can't be completed. The probability of an error in making such a decision does not exceed 0.0001, and its value decreases, with increasing n. It is established that the average time, required for the queen to be placed on one row, decreases with increasing value of n. A description is given of two random selection models and the results of their comparative analysis. A model for organizing the Back Tracking procedure is proposed based on the separation of the solution matrix into two basic levels. Regression (by ericgrig)

Completion-n-Queens-Problem Alternatives

Similar projects and alternatives to Completion-n-Queens-Problem based on common topics and language

NOTE: The number of mentions on this list indicates mentions on common posts plus user suggested alternatives. Hence, a higher number means a better Completion-n-Queens-Problem alternative or higher similarity.

Completion-n-Queens-Problem reviews and mentions

Posts with mentions or reviews of Completion-n-Queens-Problem. We have used some of these posts to build our list of alternatives and similar projects.

Stats

Basic Completion-n-Queens-Problem repo stats
1
1
4.9
over 3 years ago

The primary programming language of Completion-n-Queens-Problem is MATLAB.


Sponsored
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com