Transcription of 5 CONSTRAINT SATISFACTION PROBLEMS
{{id}} {{{paragraph}}}
5 CONSTRAINTSATISFACTIONPROBLEMSI nwhich weseehowtreatingstatesasmore thanjustlittleblack boxesleadsto theinventionofa range ofpowerfulnew search methodsanda deeperunderstandingofproblemstructure and4 exploredtheideathatproblemscanbesolvedby searchinginaspaceofstates. Thesestatescanbeevaluatedbydomain-specif icheuristicsandtestedtoseewhetherthey ,however,eachstateis is representedbyanarbi-BLACKBOX trarydatastructurethatcanbeaccessedonlyb ytheproblem-specificroutines thesuccessorfunction,heuristicfunction, , whosestatesandgoaltestconformtoa standard,structured,andverysimplereprese ntation( ).
of problem structure and complexity. Chapters 3 and 4 explored the idea that problems can be solved by searching in a ... In fact, as Exercise 5.11 asks you to prove, every higher-order, finite-domain constraint can be reduced to a set of binary constraints if enough auxiliary variables are introduced. Because
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}