Find the words using the letters in any direction but without crossing the path. Only words between 5 and 8 letters.

Note: I created the solver in 2017 as a step towards the opposite problem. Instead of finding words in a given grid, you're given the list of words and must construct a valid 3×6 grid that contains all of them. With this procedure and a lot of re$ource$ (time and space), you can unfry the egg.