An almost perfect heuristic for the N nonattacking queens problem
type: Item
instance of: scholarly article
title: An almost perfect heuristic for the N nonattacking queens problem
zbMATH Open document ID: 0696.68097
DOI: 10.1016/0020-0190(90)90156-R
published in: Information Processing Letters
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68R99
Mathematics Subject Classification ID: 05A99
Mathematics Subject Classification ID: 68W99
zbMATH DE Number: 4141538
zbMATH Keywords: combinatorial problems
zbMATH Keywords: backtracking
zbMATH Keywords: heuristic search
author: Laxmikant V. Kalé
MaRDI profile type: Publication
cites work: Backtrack programming techniques
cites work: Q3817622
cites work: A simplified solution of the n queens' problem
cites work: Parallel state-space search for a first solution with consistent linear speedups
description: scientific article; zbMATH DE number 4141538