## Variable ordering - what variable to branch on next
## Value ordering ## Constraint ordering
## Domain dependent heuristics ## Domain dependent heuristics ## Domain independent heuristics - fixed before search starts
## Dynamic variable ordering
## Assign a heuristic value to a variable that estimates how difficult/easy it is to find a satisfying value for that variable ## Assign a heuristic value to a variable that estimates how difficult/easy it is to find a satisfying value for that variable
## All solutions ## All solutions ## One solution ## Insoluble instance
## Goal: minimize size of search space explored ## Principle: - given that we have already chosen the next variable to instantiate, choose first the values that are most likely to succeed
- The most
**promising** value
**Dostları ilə paylaş:** |