The code must be in Prolog.
Implement a rule "crypto" that solves the following cryptarithmetic multiplication problem:
CHOW * CHOW = BRIGCHOW
Each of the 4 letters (C,H,O,W) stands for a different digit.
The 4 letters (B,R,I,G) can each be matched by any digit.
The aim is to find a substitution of digits for the letters
such that the above stated product is arithmetically correct.
Your program should find all answers.
It should be possible to query your solution in this manner:
Your solution should then produce all of the combinations of
the digits that satisfy the multiplication problem above.Don't get
confused between the letter "O" and the number "0" (zero).
Make sure you never let C=H, or O=W, etc... all of the distinct
letters C,H,O,W have to stand for distinct digits
Recently Asked Questions
- Let a, b, and c be integers. Consider the statement: P: c divides ab Q: c divides a R: c divides b Write the statement P Q v R Give an example of integers a, b
- The process of recycling cellular proteins that had been released by exocytosis and brought back into the cell is called
- Nursing plays an important role in the care of patients at risk for septic shock . What can the nurse do to decrease a patient 's risk of septic shock ?