Problem 6
Crypto-Arithmetic (aka Eliminating Possibilities to keep a secret)
Basic Rules: Each letter represents a single digit (0-9).No two letters can represent the same digit. All A's will have the same value.
Example: Robert is a secret agent in New York City running from the KGB. He needs to communicate a message to his FBI handler and uses the crypto-arthemtic system the worked out by sending the following text message:
TOM was riding in a CAB filled with BOAS!When Madeline (his handler) receives the message she has 15 minutes to decipher the message and locate the document at the right address
What are the possible solutions?
Last updated