๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Polynomial-Time DNA Computing Solution for the N-Queens Problem

โœ Scribed by Maazallahi, Ramin; Niknafs, Aliakbar; Arabkhedri, Paria

Book ID
121977374
Publisher
Elsevier
Year
2013
Tongue
English
Weight
955 KB
Volume
83
Category
Article
ISSN
1877-0428

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A polynomial time algorithm for the N-Qu
A polynomial time algorithm for the N-Queens problem
โœ Sosic, Rok; Gu, Jun ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Association for Computing Machinery โš– 405 KB

The __n__ -queens problem is a classical combinatorial problem in the artificial intelligence (AI) area. Since the problem has a simple and regular structure, it has been widely used as a testbed to develop and benchmark new AI search problem-solving strategies. Recently, this problem has found prac

Explicit solutions to the N -queens prob
Explicit solutions to the N -queens problem for all N
โœ Bernhardsson, Bo ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Association for Computing Machinery โš– 44 KB

The n -queens problem is often used as a benchmark problem for AI research and in combinatorial optimization. An example is the recent article [1] in this magazine that presented a polynomial time algorithm for finding a solution. Several CPU-hours were spent finding solutions for some n up to 500,0