Body: <p>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?</p>
  
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2019-05-28T00:45:45.213Z
Comments.Text: Backtracking algorithms can be improved by adding heuristics methods.
  You could add filtering and ordering techniques.
Comments.UserDisplayName: Cecelia
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2022-06-16T12:15:56.290Z
Comments.Text: @Cecelia - If you have an answer, can you please post it as an answer below instead of as a comment? Thank you!
Comments.UserDisplayName: Mithical
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2022-06-16T19:44:05.127Z
Comments.Text: This question may do better on or.stackexchange.com
Comments.UserDisplayName: Brannon
Tags: <search><constraint-satisfaction-problems><efficiency><depth-first-search><uninformed-search>
Title: How to improve the efficiency of the backtracking search in CSPs?
UserDisplayName: Abbas Ali
ThreadText: # How to improve the efficiency of the backtracking search in CSPs?
  
  (Asked by: username_0 on 2018-11-23)
  
  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?
  
  **Tags:** search, constraint-satisfaction-problems, efficiency, depth-first-search, uninformed-search
  > **Comments:**
  > **username_1**: Backtracking algorithms can be improved by adding heuristics methods. You could add filtering and ordering techniques.  
  > **username_2**: @Cecelia - If you have an answer, can you please post it as an answer below instead of as a comment? Thank you!  
  > **username_3**: This question may do better on or.stackexchange.com  
  
  ---
  
  ## 0 answers
  
  