Weak-commitment Search Algorithm
NTT Communication Science Labs.
committing to the partial solution only weakly
- Each variable has a tentative initial value.
- A consistent partial solution is constructed.
- When no consistent value exists for a variable with the partial solution, the whole partial solution is abandoned.
- The search process is restarted using the current assignment of variable values as new tentative initial values.
- The abandoned partial solution is recorded as a new nogood.