Constraint Satisfaction, Heuristic Technique, Searching Technique, Searching Algorithm, Intelligence.
Photo by Lukasz Saczek on Unsplash Constraint Satisfaction is a search procedure that operates in a space of constraint sets. The initial state contains the constraints that are originally given in the problem description. A goal state is any state that has been constrained “enough” were “enough”