Beefy Boxes and Bandwidth Generously Provided by pair Networks
XP is just a number
 
PerlMonks  

RE: RE: Stat Crack?

by jptxs (Curate)
on Nov 09, 2000 at 05:05 UTC ( [id://40663]=note: print w/replies, xml ) Need Help??


in reply to RE: Stat Crack?
in thread Stat Crack?

actually, that's jptxs :) but the whole reason i have that name is so i can continue the pox of people mispelling my name in real life out here on the internet. (for the idly curious jptxs is my initials - have fun deciphering)

"sometimes when you make a request for the head you don't
want the big, fat body...don't you go snickering."
                                         -- Nathan Torkington UoP2K a.k.a gnat

Replies are listed 'Best First'.
(redmist) RE: RE: RE: Stat Crack?
by redmist (Deacon) on Nov 09, 2000 at 05:24 UTC

      One name is correct. /me idly wonders about the math on how many guesses it would take to get it right if i keep answering and if the recursion routine that nests the nodes would break before redmist got the whole thing....

      "sometimes when you make a request for the head you don't
      want the big, fat body...don't you go snickering."
                                               -- Nathan Torkington UoP2K a.k.a gnat

        My first thougfht is that it's like a game of MastermindTM, but then I realized that we know the positions, just not the choices, and that there is a lot more possibilities. The last name in particular is probably the hardest. Since that is most likely not to be in a list of names, I would probably work it out last. Or perhaps do a different list, such as a local phone book for the area. 8)

        If I was to write this as a Perl program, I would start with a reasonable dictionary of names, find ones with no matches so that I have a "filler" when I only want to check a single position, and then start going through it.

        One algorithm would be to do five new options that match the initial letter at once to cover the boggling number of choices, and then use filler to determine which are correct. This is quicker then one name and four fillers, and as we identify correct parts we can remove those from the change in to zero in on the correct name.

        However, a better algorithm then this brute force approach would probably be better. Any ideas?

        =Blue
        ...you might be eaten by a grue...

      Gee, with a name like that he could/should be a pope!

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://40663]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others chanting in the Monastery: (3)
As of 2024-03-29 01:37 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found