I am struggling in finding the name of this game (in order to find research papers related to it in the literature).
Given an initial word $X$ and a target word $Y$, what is the minimum number of (letter) flips needed for $X$ to reach $Y$ assuming $X$ and $Y$ having the same number of letters, we flip only one letter each time and such sequence(s) of flips exist.
That is, there is a sequence $A_1\rightarrow A_2\rightarrow \dots\rightarrow A_n$ where $X=A_1$ and $Y=A_n$ and every thing in between is a correct word (i.e. has a meaning in a given dictionary).
For instance, $X=Pork\rightarrow Park\rightarrow Dark=Y$
Yes; I do not have the minimum knowledge in games.