slide1 n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Maintaining Arc Consistency (MAC) PowerPoint Presentation
Download Presentation
Maintaining Arc Consistency (MAC)

Loading in 2 Seconds...

play fullscreen
1 / 4

Maintaining Arc Consistency (MAC) - PowerPoint PPT Presentation


  • 86 Views
  • Uploaded on

Maintaining Arc Consistency (MAC) MAC is the same as Back-tracking, but with calls to AC-3 interleaved... function Backtracking-Search(csp) returns solution/failure return Recursive-Backtracking({ }, csp, domains) function Recursive-Backtracking(assignment,csp,domains) returns domains/failure

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'Maintaining Arc Consistency (MAC)' - teigra


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
slide3
Maintaining Arc Consistency (MAC)

MAC is the same as Back-tracking, but with calls to AC-3 interleaved...

function Backtracking-Search(csp) returns solution/failure

return Recursive-Backtracking({ }, csp, domains)

function Recursive-Backtracking(assignment,csp,domains) returns domains/failure

if assignment is complete then return assignment

var Select-Unassigned-Variable(Variables[csp], assignment, csp)

for each value in Order-Domain-Values(var, assignment, csp) do

if value is consistent with assignment given Constraints[csp] then

add {var = value} to assignment

reduced_domains  AC-3(assignment,csp) // check for failure too

result Recursive-Backtracking(assignment, csp, reduced_domains)

if result  failure then return result

remove {var = value} from assignment

return failure

slide4
function Min-Conflicts(csp,max_steps) returns soln/failure

current  complete, random initial var assignment

for i=1 to max_steps do

if current is a solution (satisfies all constraints) then return current

var randomly chosen conflicted variable

val value that minimizes Conflicts(var,val,current,csp)

current current  {var=val}

return failure (or best assignment found)