Write a Python program to solve the following search problem: Two words (strings) and a dictionary of legal English words are given. At each step, you can change any single letter in the word to any other letter, provided that the result is a word in the dictionary. Program should print the shortest list of words that connects the two given words in this way (if there are multiple such paths, any one is sufficient).