Challenge #239: SEND + MORE = MONEY
- Subscribe to RSS Feed
- Mark Topic as New
- Mark Topic as Read
- Float this Topic for Current User
- Bookmark
- Subscribe
- Mute
- Printer Friendly Page
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Notify Moderator
A solution to last week's challenge can be found here.
For this week's challenge, we will use Designer to solve/prove a classic verbal arithmetic problem. In this case, each letter in the equation "SEND + MORE = MONEY" will have a unique value between 0 and 9. Your job is to find the solution that makes the equation true.
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Notify Moderator
Fun challenge reminds me of the deciphering challenge.

Workflow: to find keys

Finding:

Output:

Cheers and Happy Analyzing 🙂
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Notify Moderator
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Notify Moderator
Good one .
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Notify Moderator
There are certainly smarter ways of tackling this than this brute-force approach...
Used Python to generate the permutations as I find it easier than having a nested macro here.
But there are more potential solutions (or I am misunderstanding something)
2817 + 0368 = 03185
2819 + 0368 = 03187
3712 + 0467 = 04179
3719 + 0457 = 04176
3821 + 0468 = 04289
3829 + 0458 = 04287
5731 + 0647 = 06378
5732 + 0647 = 06379
5849 + 0638 = 06487
6415 + 0734 = 07149
6419 + 0724 = 07143
6524 + 0735 = 07259
6851 + 0738 = 07589
6853 + 0728 = 07581
7316 + 0823 = 08139
7429 + 0814 = 08243
7531 + 0825 = 08356
7534 + 0825 = 08359
7539 + 0815 = 08354
7643 + 0826 = 08469
7649 + 0816 = 08465
8324 + 0913 = 09237
8432 + 0914 = 09346
8542 + 0915 = 09457
9567 + 1085 = 10652
Edit: Ok, following the link in the description of the problem
the leading digit of a multi-digit number must not be zero
Oh well...
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Notify Moderator
I used a brute-force approach to make the workflow. But it takes too long time. It is not useful workflow.
I added only two conditions that are immediately turning out.
Condition
1. "m" and "s" is not Zero
2. "m" equal One
It takes for 6 minutes 27 seconds.
Maybe I'll be back to make efficient workflow.
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Notify Moderator
Real fun. Used a kind of "smart brute force" reducing the number of possible solutions step by step.
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Notify Moderator
I am not proud of this brute force solution at all! Looking forward to seeing more elegant solutions. Video solution here: https://www.youtube.com/watch?v=D1MkKk31kDE&list=PL18SpOXDj-KMUD4YwWC5vZaUsIa7drxNZ&index=43&t=9s
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Notify Moderator
Tricky challenge!
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Notify Moderator
Great challenge. I successfully reinvented the wheel.