Looking for somewhere to start?

I found http://sig.mine.nu/~jbardin/wordsrch.c <-- that nice snippet of code as a part of a perlbased wordfind generator. Now all someone needs to do is get this working as a module and into the latest distribution ;). The example has quite a bit of run around typicaly found in c code (sorting arrays by element size, nasty iterators etc.) But it is well documented and goes into some nice details on the game theory behind wordfind puzzle generation. This weeks comp. has proven to be rather difficult. I was also wondering if anybody wanted to share some ideas on the 'front-end' of the puzzle. i am pondering maybe to use a html table with each td having some javascript so that when the user clicks the cell it will change the style so it has a border, or change its color.. some way of 'highlighting' that cell. But i have yet to come up with a effecient means of verifying the user submitted solution...

Only problem I can see with that code - at a quick glance, it doesn't allow the user to specify the grid size. It automatically makes the grid as small as it can. Which may not be bad, but, to my reading, may not fit the code specs.

For theory, this looks like a great resource - pity I didn't read this forum sooner!

Regards,
-Toby

For some reason my connection keeps cutting out. so if the file isnt availbalbe try back later. And yes, from what i have so far the tricky part is to get the words to fit into the grid.. and or let the grid be growable. as the grid cannot be a fixed size in all cases as there might be a comibation of words that will fit perfect into a grid using all the spaces and then 1 more word that wont fit in anywhere at all, hence the grid needs to be able to grow in such a case.