Solved
Cryptarythmatic with Forward Checking, MRV, and Least Constraining Value
Posted on 2010-11-12
Question: Solve the cryptarythmetic problem in Figure 6.2 by hand, using the strategy of backtracking with forward checking and the MRV and least-constraining-value heuristics.
In a cryptarythmetic problem, each of the letters are unknown numbers; usually different ones.
The C variables are carries, so one mathematical sentence that occurs will be
O + O = R * X_1, where O and R are between 0 and 9 inclusive, and X_1 has the domain { 0, 1 }.
I'm trying to understand how to approach this problem with "backtracking with forward checking and the MRV and least-constraining-value heuristics."