[FWP] Jotto jot-matcher

["Bernie Cosell" <bernie@fantasyfarm.com>]

Small challenge [only asking here because I'm finding it surprisingly 
difficult to do, and so I'm thinking that I must be overlooking something 
clever]:  Write a boolean subroutine to determine whether a word matches 
a probe/jots result; _fast_ is more important than small.

I figure you can assume that either/both of the words have some kind of 
associated info along with them [that is, neither word need be just a 
string --- e.g., the 'words' could be sorted lists of letters if that 
makes the match faster]

  /Bernie\

ps, what i'm up to: I am fooling with whipping up a 'jotto player' that 
uses that -very- nasty algorithm I mentioned earlier in the jotto thread. 
I'm going to set it up as a CGI [which actually presents some quite cute 
and tricky programming problems, all by itself!]  /b\
-- 
Bernie Cosell                     Fantasy Farm Fibers
mailto:bernie@fantasyfarm.com     Pearisburg, VA
    -->  Too many people, too few sheep  <--          

==== Want to unsubscribe from Fun With Perl?  Well, if you insist...
==== Send email to <fwp-request@technofile.org> with message _body_
====   unsubscribe