1
$\begingroup$

What would be the best performing algorithm to solve the Word Ladder problem, in terms of guaranteed finding of the shortest solution in the shortest possible time? Is it BFS, DFS, A*, IDA* or another one? How are these algorithms compared with each other?

For the Word Ladder puzzle, a starting and an ending word of the same length are given. The goal is to convert the starting word to the ending word by changing only on letter at a time. Intermediate words should be valid words. E.g. silly => sully => sulky => hulky => hunky => funky => funny

$\endgroup$
4
  • 1
    $\begingroup$ What do you mean by "best performing"? Performing in terms of what? $\endgroup$
    – nbro
    Commented Mar 26, 2022 at 20:41
  • $\begingroup$ Best performing in terms of guaranteed finding of the shortest solution in the shortest possible time $\endgroup$ Commented Mar 27, 2022 at 9:26
  • $\begingroup$ Ok. Edit your post to include this info! What do you know about this problem and algorithms? For example, can DFS be applied to this problem? $\endgroup$
    – nbro
    Commented Mar 27, 2022 at 9:30
  • $\begingroup$ Ok, the question is edited. I know that BFS and A* can be applied, probably also DFS, but I don't know which one will give a guaranteed optimal solution. $\endgroup$ Commented Mar 27, 2022 at 10:01

0

You must log in to answer this question.

Browse other questions tagged .