Extending AFB-BackJumping Academic Article uri icon


  • Before adding a backjump mechanism, one first needs to add a value ordering heuristic. A value ordering heuristic is a heuristic for reordering the domain values of agents. Since agents pick their next assignment to be the next untested value in their value domain, ordering these values in different ways has the potential to produce different performances, as shown for example in [14]. A good value ordering heuristic for AF B is called min-cost and the resulting version of the algorithm is called accordingly AFB-minC. The mincost …

publication date

  • January 1, 2008