The following program finds path containing swap patterns to convert start string to end string, where only permissible actions is swapping adjacent characters.
Heuristic used is 7th power of distance between characters of start and end string. However,the program works only for strings containing unique characters. To overcome this issue ,you can raise an issue or contribute.