PDF4PRO ⚡AMP

Modern search engine that looking for books and documents around the web

Example: confidence

5 CONSTRAINT SATISFACTION PROBLEMS

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( ).Searchal-REPRESENTATION gorithmscanbedefinedthattake advantageofthestructureofstatesandusegen eral-purposeratherthanproblem-specifiche uristicsto enablethesolutionoflargeproblems( ).

search problem as follows:}Initial state: the empty assignment fg, in which all variables are unassigned.}Successor function: a value can be assigned to any unassigned variable, provided that it does not conflict with previously assigned variables.}Goal test: the current assignment is complete.}Path cost: a constant cost (e.g., 1) for every step.

Loading..

Tags:

  Satisfaction, Problem, Assignment, Constraints, Constraint satisfaction

Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Spam in document Broken preview Other abuse

Transcription of 5 CONSTRAINT SATISFACTION PROBLEMS

Related search queries