Pff, they kept pushing me to write an explanation. Ok. Here you go.
This challenge basically asked for backtracking, and perl already has
a backtracking system: the regex engine. So my idea was to take the
boggle board as a string to match on, and rewrite the target word as a
regex and then see if
Not that there's anything terribly interesting in this, but I'd like to increase
the volume on this list, and try to get people in the habit of explaining what
they are doing. Here is an explanation of my boggle solution:
#!perl -p
[EMAIL PROTECTED],32|$;++/4+$;while$_=pop}
sub b{
my($p,$n,@L)[EMA
I'll follow up the new trend of explaining my solution. It's not as advanced as the
others so far, but i think it's quite clever :)
my solution is quite straight forward. the only thing that a few have missed is the
way to find if the next letter is "adjacent" to the current one.
if you see the
