RE: Permutation function
- Posted by mistertrik at hotmail.com Nov 13, 2002
- 368 views
I dissent... this code is more of an anagram solver. Could the code from the comp do that? ===================================================== .______<-------------------\__ / _____<--------------------__|=== ||_ <-------------------/ \__| Mr Trick >From: rforno at tutopia.com >Subject: RE: Permutation function > > >The last contest in Euphoria was exactly on this subject (at least the >intermediate difficulty one): find all English words with a pattern (with >more options than the ones you wish). >----- Original Message ----- >From: <favreje at yahoo.com> >To: EUforum <EUforum at topica.com> >Sent: Wednesday, November 13, 2002 1:02 AM >Subject: RE: Permutation function > > > > Thanks Trick... I'd love to see the code you have. I found a website on > > permutation theory. So I'm learning all about cycles, orbits, and > > products of transpositions. It always helps to understand why the code > > works, eh? > > > > Seems like the time/space constraints come into play more when I check a > > given permuation against the dictionary. But there should be a way to > > reject entire series, or cycles of permuations outright (maybe based on > > a hash function) by determining that no english words begin a particular > > 3 letter sequence? I'm still thinking it through. > > > > > > mistertrik at hotmail.com wrote: > > > > > > Well, if they're real words, then I'm guessing you want to know what > > > words > > > you can make given the available tiles. > > > > > > That's exactly what my code does, and a lot more efficiently too. I > > > don't > > > care how fast your code is, it takes a while to generate 3.6 million > > > permutations, and it uses a lot of space. > > > > > > If you can wait a few hours, I'll send it to you once I get home. > > > ===================================================== > > > .______<-------------------\__ > > > / _____<--------------------__|=== > > > ||_ <-------------------/ > > > \__| Mr Trick > > > > > > > > > >From: favreje at yahoo.com > > > >Reply-To: EUforum at topica.com > > > >To: EUforum <EUforum at topica.com> > > > >Subject: Re: Permutation function > > > >Date: Tue, 12 Nov 2002 17:53:53 -0800 (PST) > > > > > > > > > > > >Actually, I am generating permutations for the fun of it! (kinda >sick, > > > >eh?). I'm writing a scrabble-like word-play game (primarily to > > > >familiarize > > > >myself with Euphoria) that makes matrices of words no longer than 10 > > > >characters in length. The permutation algorithm supports the >computer > > > >player's generation of words. (With only 10 characters per word, and >a > > > >good hash function, I should be able to handle the 3.6 million >possible > > > >results, right?) > > > > > > > > > > > >I have a funky bit of code at home (at work now) that can find words > > > >that > > > >can be made from a given sequence of letters. > > > >That uses a permutation function of sorts. What is this function >wanted > > > >for? > > > > > > > >I remember the first way I went about doing things was to generate a > > > >permutation, then try and match it to the dictionary. This is *NOT* a > > > >good > > > >way of doing things. The number of permutations to word length ramps >up > > > >VERY > > > >quickly. if you have a 15 length sequence, there are roughly 100 >billion > > > >permutations. Not good. > > > > > > > >I'm assuming you're not generating permutations for the fun of it. > > > >Perhaps > > > >you can tell us what this permutation function is for? > > > >===================================================== > > > >.______<-------------------\__ > > > >/ _____<--------------------__|=== > > > >||_ <-------------------/ > > > >\__| Mr Trick > > > > > > > > > > > > >From: thomas at columbus.rr.com > > > > >Reply-To: EUforum at topica.com > > > > >To: EUforum > > > > >Subject: Permutation function <snip> > >