Solved

Cryptarythmatic with Forward Checking, MRV, and Least Constraining Value

Posted on 2010-11-12
9
831 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
  • 6
  • 3
9 Comments
 
LVL 84

Accepted Solution

by:
ozo earned 500 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 500 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
Problems using Powershell and Active Directory?

Managing Active Directory does not always have to be complicated.  If you are spending more time trying instead of doing, then it's time to look at something else. For nearly 20 years, AD admins around the world have used one tool for day-to-day AD management: Hyena. Discover why

 

Author Comment

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

Assisted Solution

by:ozo
ozo earned 500 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

Complete VMware vSphere® ESX(i) & Hyper-V Backup

Capture your entire system, including the host, with patented disk imaging integrated with VMware VADP / Microsoft VSS and RCT. RTOs is as low as 15 seconds with Acronis Active Restore™. You can enjoy unlimited P2V/V2V migrations from any source (even from a different hypervisor)

Question has a verified solution.

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

Does the idea of dealing with bits scare or confuse you? Does it seem like a waste of time in an age where we all have terabytes of storage? If so, you're missing out on one of the core tools in every professional programmer's toolbox. Learn how to …
Whether you've completed a degree in computer sciences or you're a self-taught programmer, writing your first lines of code in the real world is always a challenge. Here are some of the most common pitfalls for new programmers.
In this fifth video of the Xpdf series, we discuss and demonstrate the PDFdetach utility, which is able to list and, more importantly, extract attachments that are embedded in PDF files. It does this via a command line interface, making it suitable …
In this seventh video of the Xpdf series, we discuss and demonstrate the PDFfonts utility, which lists all the fonts used in a PDF file. It does this via a command line interface, making it suitable for use in programs, scripts, batch files — any pl…

773 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