On Fri, Aug 06, 1999 at 10:45:51AM -0400, Bernie Cosell wrote: > 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. > Couldn't you use the same scoring method that created the jots result in the first place? Instead of comparing the hidden word and the guessed word, compare the guessed word and the word you want to guess next. If the results match, then you could have the right word. Ronald ==== Want to unsubscribe from Fun With Perl? Well, if you insist... ==== Send email to <fwp-request@technofile.org> with message _body_ ==== unsubscribe