Literature Review on Constraint Satisfaction Problems Solving

Problems known as Constraint Satisfaction issues (CSPs) are the ones on which every variable needs to be given e certain value in order to satisfy all the given constraints. In real life, many requirements such as resource allocation, scheduling, and planning, revolve around these Constraints Satisfaction Issues. This review offers a thorough rundown of the main approaches used to solve CSPs up to date, including heuristic techniques, contemporary and classical algorithms, and underlying theories for such issues. It focuses on specific CSPs and their solving methods, looks at real-life uses, and looks at potential paths for further study. The paper focuses on how the efficiency and scalability of CSP solvers are continuously being improved by developments in methods like constraint programming, SAT solvers, and machine learning