It is a global minimization. It takes 261 insert/delete operations from Massachusetts to South Dakota.
I got many different solutions with 261 insert/delete operations. Some 262 and more, but none 260 or less.
It’s a challenge to everybody interested to do better. I am not sure if it’s possible.
Not clear what the number of operations has to do with it; isn’t the challenge to find a smaller total Levenshtein difference?
Incidentally, does it make a difference if you consider the end of the string to wrap around to the beginning?
The Levenshtein difference IS the number of insert/delete operations necessary, to transform a string A to string B.
Wrapping around, a circular list, is another option, yes.
Ah! Well then, I learned something today, I can go to bed. :)
It is a global minimization. It takes 261 insert/delete operations from Massachusetts to South Dakota.
I got many different solutions with 261 insert/delete operations. Some 262 and more, but none 260 or less.
It’s a challenge to everybody interested to do better. I am not sure if it’s possible.
Not clear what the number of operations has to do with it; isn’t the challenge to find a smaller total Levenshtein difference?
Incidentally, does it make a difference if you consider the end of the string to wrap around to the beginning?
The Levenshtein difference IS the number of insert/delete operations necessary, to transform a string A to string B.
Wrapping around, a circular list, is another option, yes.
Ah! Well then, I learned something today, I can go to bed. :)