Backtracking search is the basic uninformed search algorithm for constraint satisfaction problems (CSPs). How could we improve the efficiency of the backtracking search in CSPs?
$\begingroup$
$\endgroup$
3
-
$\begingroup$ Backtracking algorithms can be improved by adding heuristics methods. You could add filtering and ordering techniques. $\endgroup$– CeceliaCommented May 28, 2019 at 0:45
-
$\begingroup$ @Cecelia - If you have an answer, can you please post it as an answer below instead of as a comment? Thank you! $\endgroup$– Mithical ♦Commented Jun 16, 2022 at 12:15
-
$\begingroup$ This question may do better on or.stackexchange.com $\endgroup$– BrannonCommented Jun 16, 2022 at 19:44
Add a comment
|