Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

Re(5): Puzzle: need a more general algorithm

by FoxtrotUniform (Prior)
on Jul 09, 2002 at 15:04 UTC ( #180498=note: print w/ replies, xml ) Need Help??


in reply to Re: Re(3): Puzzle: need a more general algorithm
in thread Puzzle: need a more general algorithm

D'oh!

Fortunately, a man far smarter than I has written an article that you might find useful. ("Pre-Fascicle 2c: Generating all combinations", about halfway down the page. The draft is a .ps.gz file, which is why I didn't link to it directly.)

--
The hell with paco, vote for Erudil!
:wq


Comment on Re(5): Puzzle: need a more general algorithm
Re: Re (5): Puzzle: need a more general algorithm
by Ovid (Cardinal) on Jul 09, 2002 at 15:42 UTC

    After giving this some thought, I realized that traditional permutation generators are going to have a problem here. Consider the following four permutations:

    11100 11100 11100 11100

    Those can be different permutations. The second could have the first and second ones swapped, the third could have the last fourth and fifth zeroes swapped, etc. Even though, to us, they look the same, the permutators that I've played with don't see that (and how would they calculate it?).

    And it was an interesting coincidence to see the Knuth thread on /. this morning. I'm checking it out now.

    Cheers,
    Ovid

    Join the Perlmonks Setiathome Group or just click on the the link and check out our stats.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (9)
As of 2014-12-25 06:15 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (159 votes), past polls