An almost perfect heuristic for the N nonattacking queens problem (Q911320): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Backtrack programming techniques / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3817622 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A simplified solution of the n queens' problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel state-space search for a first solution with consistent linear speedups / rank | |||
Normal rank |
Latest revision as of 14:06, 20 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An almost perfect heuristic for the N nonattacking queens problem |
scientific article |
Statements
An almost perfect heuristic for the N nonattacking queens problem (English)
0 references
1990
0 references
combinatorial problems
0 references
backtracking
0 references
heuristic search
0 references