Package omnics.strategy

Provides different heuristics defining the strategies that control the solver.

See:
Description

Interface Summary

AssignmentStrategy	Describes an heuristic responsible with selecting the next value that will be assigned to a specified variable.
BackwardStrategy	Describes an heuristic responsible with selecting the variable to which the systematic search algorithm will return in case of failure.
ForwardStrategy	Describes an heuristic responsible with selecting the next variable to be instantiated by the solver.
SolverStrategy	Describes an exploration strategy for a SystematicSolver.

Class Summary

AbstractStrategy	Represents an abstract implementation of SolverStrategy interface.
BackJumping	Implementation of backjumping algorithm.
ConsistentAssignment	A special implementation of AssignmentStrategy that selects the values acording to the domain order, assuming that the problem currently beeing solved is arc-consistent.
MinCostAssignment
MinDomForward	Represents the variable heuristic that chooses the variable with the smallest domain.
SimpleAssignment	A simple implementation of the AssignmentStrategy that selects the values acording to the domain order.
SimpleBackward	A simple implementation of the BackwardStrategy, representing chronological backtracking.
SimpleForward	A simple implementation of the ForwardStrategy - the variables are selected acording to their natural order.

Package omnics.strategy Description

Provides different heuristics defining the strategies that control the solver.