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$ Backtracking algorithms can be improved by adding heuristics methods. You could add filtering and ordering techniques. $\endgroup$
    – Cecelia
    May 28 '19 at 0:45

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.