Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV CLASS NEXT CLASS | FRAMES NO FRAMES
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD

## ifs.heuristics
Interface ValueSelection

All Known Implementing Classes:
  DbtValueSelection, GeneralValueSelection, PlacementSelection

    public interface ValueSelection

Value selection criterion.
After a variable is selected, we need to find a value to be assigned to the variable. This problem is usually called "value selection" in constraint programming. Typically, the most useful advice is to select the best-fit value. So, we are looking for a value which is the most preferred for the variable and which causes the least trouble as well. This means that we need to find a value with the minimal potential for future conflicts with other variables. For example, a value which violates the smallest number of soft constraints can be selected among those with the smallest number of hard conflicts.
The task of this criterion is to select a value of the given variable which will be assigned to this variable.

Version:
  1.0
Author:
  Tomáš Müller
See Also:
  `Solver`

Method Summary
`void` | `init(Solver solver)` Initialization
`Value` | `selectValue(Solution solution, Variable selectedVariable)` Value selection

Method Detail

### init

    void init(Solver solver)

  Initialization

### selectValue

    Value selectValue(Solution solution,
                      Variable selectedVariable)

  Value selection

  Parameters:
    `solution` - current solution
    `selectedVariable` - selected variable

Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV CLASS NEXT CLASS | FRAMES NO FRAMES
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD

Copyright © 2005 Tomáš Müller