• Mayuri Sahay
• Purnima Gupta

The term backtracking search is used for depth-first search that elects values for a single variable at once and backtracks when the same has no appropriate values left to designate. This study sheds light on the strengths, weaknesses, and nuances of backtracking as an essential problem-solving methodology. It is easy to implement and understand as it follows a neutral trial-and-error approach. It is complete it can find a solution if one exists or prove that none exists by exploring the entire solution space. Backtracking can be described as a general algorithm technique which searches every possible solution for solving a computational equation.

Constraint Satisfaction, Data Structure, Optimization, Problem Formulation

"Design and Evaluation of Algorithms on Backtracking", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.10, Issue 10, page no.f471-f476, October-2023, Available :http://www.jetir.org/papers/JETIR2310457.pdf

"Design and Evaluation of Algorithms on Backtracking", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.10, Issue 10, page no. ppf471-f476, October-2023, Available at : http://www.jetir.org/papers/JETIR2310457.pdf