Been playing around with adding some more variety into the ways words can be placed into a grid for a word search.
Today, mainly focusing on the L-shaped knight move from chess. Turns out it's extremely flexible and as a result causes everything to explode in a frenzy of slowness. Not too unexpected, but I'm curious how much of that I can mitigate.
Even for a relatively small grid (13x10) my current algorithm to figure out possibilities for a single word starting at a single place breaks itself and runs out of memory. A good start!
One to ruminate on methinks.
[Image credit: Peter Miller]