5 CONSTRAINT SATISFACTION PROBLEMS

← Back to document page

5CONSTRAINTSATISFACTIONPROBLEMSInwhich weseehowtreatingstatesasmore thanjustlittleblack boxesleadsto theinventionofa range ofpowerfulnew search methodsanda deeperunderstandingofproblemstructure and4 exploredtheideathatproblemscanbesolvedby searchinginaspaceofstates. Thesestatescanbeevaluatedbydomain-specif icheuristicsandtestedtoseewhetherthey ,however,eachstateis is representedbyanarbi-BLACKBOXtrarydatastr ucturethatcanbeaccessedonlybytheproblem- specificroutines thesuccessorfunction,heuristicfunction, , whosestatesandgoaltestconformtoa standard,structured,andverysimplereprese ntation( ).

maximum domain size of any variable in a CSP is d, then the number of possible complete assignments is O(dn)—that is, exponential in the number of variables. Finite-domain CSPs BOOLEAN CSPS include Boolean CSPs, whose variables can be …

  Satisfaction, Constraints, Constraint satisfaction