?
Solved

Cryptarythmatic with Forward Checking, MRV, and Least Constraining Value

Posted on 2010-11-12
9
Medium Priority
?
885 Views
Last Modified: 2012-05-10
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."
0
Comment
Question by:JCW2
[X]
Welcome to Experts Exchange

Add your voice to the tech community where 5M+ people just like you are talking about what matters.

  • Help others & share knowledge
  • Earn cash & points
  • Learn & ask questions
  • 6
  • 3
9 Comments
 
LVL 84

Accepted Solution

by:
ozo earned 1500 total points
ID: 34125450
In solving by hand, how would you describe the methods you use, without worrying about the names of the techniques?
0
 

Author Comment

by:JCW2
ID: 34125644
Backtracking: "The term backtracking search is used for a depth first search that chooses values for one variable at a time and backtracks when a variable has no legal moves left to assign."

Forward checking: "Whenever a variable X is assigned, the forward-checking process establishes arc-consistency for it: for each unassigned variable Y that is connected to X by a constraint, delete from Y's domain any value that is inconsistent with the value chosen for X."

MRV: Most constrained variable. "It also has been called the 'most constrained variable' or 'fail-first' heuristic, the latter because it picks a variable that is most likely to cause a failure soon, thereby pruning the search tree. If some variable X has no legal values left, the MRV heuristic will select X and failure will be detected immediately- avoiding pointless searches through other variables."

Least-constraining-value: "Once a variable has been selected, the algorithm must decide on the order in which to examine its values. For this, the least-constraining-value heuristic can be effective in some cases. It prefers the value that rules out the fewest choices for the neighboring variables in the constraint graph."
0
 
LVL 84

Assisted Solution

by:ozo
ozo earned 1500 total points
ID: 34125743
I'm not asking for the definition of the terms, I'm asking what you do when you solve cryptarythmetic problems by hand.
However, since you mentioned those techniques, do you recognize any similarity with what you do?
Could the way you solve them by hand be made more efficient by applying those principles?
0
Get proactive database performance tuning online

At Percona’s web store you can order full Percona Database Performance Audit in minutes. Find out the health of your database, and how to improve it. Pay online with a credit card. Improve your database performance now!

 

Author Comment

by:JCW2
ID: 34125744
I've forgotten the diagram:
Diagram.PNG
0
 
LVL 84

Assisted Solution

by:ozo
ozo earned 1500 total points
ID: 34125766
Can you fill in the constraints?
Is that the way you would solve it by hand?
Does seeing the constraints that way make the hand solution easier?
0
 

Author Comment

by:JCW2
ID: 34125786
A description of how I would solve this cryptarythmatic problem without any other instructions:

Assign 7 to T.
Therefore, C_3 = 1, F = 1, and O = 4.
Assign 3 to W.
Therefore, U = 6 and C_2 = 0.
O + O = R = 8, with C_1 = 0.
T was revised from 9 to 7.

In all, T = 7,   W = 3,
          O = 4,   F = 1,
          U = 6,   R = 8,
          X_1 = 0, X_2 = 0, and X_3 = 1.
0
 

Author Comment

by:JCW2
ID: 34128801
What is your feedback?
0
 

Author Comment

by:JCW2
ID: 34129113
0
 

Author Closing Comment

by:JCW2
ID: 34146856
Thank you for your help.

Reason for B grade:

Commenter (Ozo) did not respond to my message. Even something like "I don't know" would have been better than nothing.
0

Featured Post

Free Tool: ZipGrep

ZipGrep is a utility that can list and search zip (.war, .ear, .jar, etc) archives for text patterns, without the need to extract the archive's contents.

One of a set of tools we're offering as a way to say thank you for being a part of the community.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Whether you’re a college noob or a soon-to-be pro, these tips are sure to help you in your journey to becoming a programming ninja and stand out from the crowd.
What do responsible coders do? They don't take detrimental shortcuts. They do take reasonable security precautions, create important automation, implement sufficient logging, fix things they break, and care about users.
Although Jacob Bernoulli (1654-1705) has been credited as the creator of "Binomial Distribution Table", Gottfried Leibniz (1646-1716) did his dissertation on the subject in 1666; Leibniz you may recall is the co-inventor of "Calculus" and beat Isaac…
I've attached the XLSM Excel spreadsheet I used in the video and also text files containing the macros used below. https://filedb.experts-exchange.com/incoming/2017/03_w12/1151775/Permutations.txt https://filedb.experts-exchange.com/incoming/201…

770 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question