I was thinking a solver that found the most efficient, least number of hops to reach target word from seed word. Maybe it is an NP Hard problem? This also remin

I was thinking a solver that found the most efficient, least number of hops to reach target word from seed word. Maybe it is an NP Hard problem? This also reminds me of 7 degrees of Kevin Bacon. I could see this going over well for an Online "socially distanced" game night, or possibly a classroom activity to encourage efficient research techniques.