There are many words in English language with letters in alphabetical order e.g. not, biopsy (both in A to Z direction) or wronged, rib (in Z to A direction).
Please consider words that can be split into two parts each complying with one of the above structures (i.e. a-z or z-a ).
Those parts need not (but preferably may) be valid English words.

Examples:
azaz: stu/dent
azza: box/wood
zaaz: tri/cky
zaza: trea/son

For each of the above 4 classes provide a word with maximal score, as defined below:
1. Each letter gets its matching number: A is 1, B is 2, ...Z is 26.
2. If both parts consist of actually existing words double the words values.
3. The sum of the four results is your score.

Example: BOX / WOOD = 2*(2+15+24+23+15+15+4) = 2*98 = 196

Go get the highest value!

Hi. I like to solve all sorts of mathematical and algorithmic problems. Recently learned from a friend about online game https://mr.bet/at/game/view/demo/hotline. Has anyone already played it? How are you doing? 

Posted by Demetria Russell on 2021-05-30 14:15:09