An analytical evidence for Kalé's heuristic for the \(N\) queens problem

DOI10.1016/0020-0190(93)90196-GzbMath0768.68111OpenAlexW2038113223MaRDI QIDQ1210322

Sang-Bong Oh

Publication date: 23 May 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90196-g

zbMATH Keywords

combinatorial problemssearch techniques\(N\) queens problembacktracksKalé's heuristic

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Enumerative combinatorics (05A99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• An almost perfect heuristic for the N nonattacking queens problem

This page was built for publication: An analytical evidence for Kalé's heuristic for the \(N\) queens problem