New decision rules for exact search in \(N\)-queens (Q652694): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MINION / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-011-9653-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067988777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of known results and research areas for \(n\)-queens / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backtrack programming techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PARALLEL MEMORY ALLOCATION AND DATA ALIGNMENT IN SIMD MACHINES / rank
 
Normal rank
Property / cites work
 
Property / cites work: An almost perfect heuristic for the N nonattacking queens problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average complexity of depth-first search with backtracking and cutoff / rank
 
Normal rank

Latest revision as of 18:36, 4 July 2024

scientific article
Language Label Description Also known as
English
New decision rules for exact search in \(N\)-queens
scientific article

    Statements

    New decision rules for exact search in \(N\)-queens (English)
    0 references
    0 references
    15 December 2011
    0 references
    0 references
    decision heuristics
    0 references
    \(N\)-queens
    0 references
    global search
    0 references
    constraint satisfaction
    0 references
    maximum clique
    0 references
    0 references