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

Re^4: Challenge: 8 Letters, Most Words (Update2:Then again :)

by Limbic~Region (Chancellor)
on Oct 05, 2013 at 04:01 UTC ( #1056999=note: print w/ replies, xml ) Need Help??


in reply to Re^3: Challenge: 8 Letters, Most Words (Update2:Then again :)
in thread Challenge: 8 Letters, Most Words

BrowserUk,
You don't need 7 repeats to exhibit the problem:

aabc aacb aabc aabc abca eefg efge eegf eegf efeg aabcxy eefglm
Your code produces: a b c e f g m x: 0

Cheers - L~R


Comment on Re^4: Challenge: 8 Letters, Most Words (Update2:Then again :)
Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (14)
As of 2014-10-20 18:28 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    For retirement, I am banking on:










    Results (88 votes), past polls