Accelerating backtrack search with a best-first-search strategy

Published Online: Dec 20, 2014

Page range: 901 - 916

Received: Feb 02, 2014

DOI: https://doi.org/10.2478/amcs-2014-0066

Keywords

best-first search, backtrack, branch-and-bound, constraint satisfaction problem, frequent restarting

© by Zoltán Ádám Mann

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.