Fast search algorithms for the n-queens problem
From MaRDI portal
Publication:4017752
DOI10.1109/21.135698zbMath0792.68168OpenAlexW2155058940MaRDI QIDQ4017752
Publication date: 16 January 1993
Published in: IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/79d2fa13d4a5cfc02ff6936b6083bb620e4e0ce1
Searching and sorting (68P10) Combinatorics in computer science (68R05) Combinatorial inequalities (05A20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (3)
The \(Multi\)-SAT algorithm ⋮ Search techniques for SAT-based Boolean optimization ⋮ Queens, attack!
This page was built for publication: Fast search algorithms for the n-queens problem