The minimum remaining value (MRV) heuristic is a search optimization which can be described as follows: the next variable to assign is chosen based on how many values each variable has remaining, in other words choosing the variable which is most likely to cause a constraint violation sooner is picked.
The optimization should be easy to enable and disable as needed.
Acceptance Criteria
[x] The MRV search optimization is implemented
[x] The optimization is easy to enable and disable
Description
The minimum remaining value (MRV) heuristic is a search optimization which can be described as follows: the next variable to assign is chosen based on how many values each variable has remaining, in other words choosing the variable which is most likely to cause a constraint violation sooner is picked.
The optimization should be easy to enable and disable as needed.
Acceptance Criteria
Related issues
Child of #11 and #12
Additional Resources
Add attachments, external links, etc here.