My first post did not take into account that the alphametic solution was required to have a unique numeric solution.  This would not be the first time that I misunderstood a problem, or overlooked a key word.

But in my opinion, the current problem does not specify that uniqueness is required.  Uniqueness was required and is even part of the title of the earlier problem, pid=13696, but neither is true for the current problem.

Having said that, it seems clear now that uniqueness was the intent.

One more point:  consider in object oriented program how there are "classes", and daughter classes inherit the properties of the parent class.  The analogy to Perplexus problems is that some problems are part of group or series of related problems.  For this puzzle, I did not automatically assume that all the properties of the earlier problem inherited to this one.  Plus, to be honest, I never worked on the earlier puzzle.

In my earlier post, I had, for example TWELVE + TWELVE = ABACUS, which has 2 numeric solutions, each with the same pattern (101000), but with different SODs:  (so it was not unique)

186546 373092  with sod(373092)=24

267907 535814  with sod(535814)=26

I modified my program to look at all possible values of sod() for the new word, then make a dictionary where the keys are the patterns of the new word, and the values are lists of sod's which can produce that particular pattern.  My word list is not as extensive as others, so I doubt I will find anything new, and I won't find everything ....

... findings:

{'000011': [23],

 '010001': [23, 30],

 '101000': [24, 26],

 '001010': [24, 29, 31],

 '001001': [26, 26, 26, 26, 30, 30],

 '110000': [26],

 '010010': [26, 28],

 '000110': [28],

 '011000': [29, 31],

 '000101': [30]}

So I'm finding potentially unique solutions only for a few patterns: 

pattern   sod    TWELVE   RHS     Example

'000011': [23] 451861  903722  ACROSS (unique)

'110000': [26] 385645  771290  no words found in my list

'000110': [28] 354614  709228  GRUBBY (unique)

'000101': [30] 453813  907626  CANDID (unique)

It is conceivable that for a given sod and a given pattern, there might be 2 different numeric solutions, but I did not find that for the above.

Charlie:  For sod of 25 I found no solutions (the program just printed it out as a heading)

 ---------  additional code ---------

patternDictionary = {}

...

...

    for r in rightnumbers:

        print(int(r/2), r, pattern(r))

        if pattern(r) not in patternDictionary:

            patternDictionary[pattern(r)] = [sod_of_RHS]

        else:

            patternDictionary[pattern(r)].append(sod_of_RHS)

        try:

            print(wdpatterns[pattern(r)], '\n')

        except:

            print('pattern error')

    print()

for x in ['000011','110000','000110','000101']:

    print(x)

    try:

        print(wdpatterns[x])

    except:

        print('no words found')

    print()