![]() ![]() | Constant which represent ascending variable ordering. |
![]() ![]() | Constant which represent the minimum width variable ordering. |
![]() |
Initializes a new instance of the "GeneralizedLookahead" class. |
![]() | Gets or sets the variable ordering. |
![]() | This method backtracks the changes the variable "villain" executed on the other variables' domains. |
![]() | Determines whether the specified Object is equal to the current Object. |
![]() | Loops through future variables with respect to the current variable. This method checks if one of the future variables' domains is empty with the current assignment. |
![]() | Serves as a hash function for a particular type. GetHashCode is suitable for use in hashing algorithms and data structures like a hash table. |
![]() | Gets the Type of the current instance. |
![]() | The Generalized Lookahead routine from Dechter page 133 |
![]() | Method for making LookAheadVar objects from CasperVarDom objects, for internal use in this class. Different variable orderings can be made with the constraint graph. |
![]() | Checks each domain value for the future variables domains in forwardCheck Here we do the actual consistency check with the provided consistency implementation. |
![]() | Updates the AllRemovedValues-structure with the removed value of variable "victim" caused by variable "villain". |
![]() | Implementation of Select Value Forward Checking from Dechter page 134 Internal method used by the LookAhead method |
![]() | Returns a String that represents the current Object. |
![]() | Allows an Object to attempt to free resources and perform other cleanup operations before the Object is reclaimed by garbage collection. |
![]() | Creates a shallow copy of the current Object. |