Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re: Cryptogram Solver

by rpc (Monk)
on Mar 23, 2001 at 05:37 UTC ( [id://66548]=note: print w/replies, xml ) Need Help??


in reply to Reaped: Cryptogram Solver

This is basically a two step problem.

  1. Generate a unique combination of symbols. Don't repeat the same combination twice.
  2. Decide whether or not the substitution generates meaningful output. This can either be done by manual inspection, or frequency analysis. If you choose to use frequency analysis, you'll need a decent set of frequencies to compare it against.

As far as your existing code is concerned, it might help if you put it in <CODE> tags.

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (2)
As of 2024-04-20 15:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found