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?
Asked
Active
Viewed 3,234 times
1
-
Backtracking algorithms can be improved by adding heuristics methods. You could add filtering and ordering techniques. – Cecelia May 28 '19 at 00:45
-
@Cecelia - If you have an answer, can you please post it as an answer below instead of as a comment? Thank you! – Mithical Jun 16 '22 at 12:15
-
This question may do better on or.stackexchange.com – Brannon Jun 16 '22 at 19:44