Re: [Haskell-cafe] What algorithm to use ?

2007-10-22 Thread Derek Elkins
On Mon, 2007-10-22 at 10:09 +0200, manu wrote: > Hello > > I am not sure it is appropriate to post to this mailing list to > inquire about a peculiar algorithm, if not let me know... > > I was looking at one particular puzzle posted on the Facebook site, > 'Wiretaps' (http://www.facebook.com/

Re: [Haskell-cafe] What algorithm to use ?

2007-10-22 Thread Brent Yorgey
On 10/22/07, manu <[EMAIL PROTECTED]> wrote: > > Hello > > I am not sure it is appropriate to post to this mailing list to > inquire about a peculiar algorithm, if not let me know... > > I was looking at one particular puzzle posted on the Facebook site, > 'Wiretaps' (http://www.facebook.com/jobs_p

Re: [Haskell-cafe] What algorithm to use ?

2007-10-22 Thread Brandon S. Allbery KF8NH
On Oct 22, 2007, at 4:09 , manu wrote: However looking at the number of permutations (26! = 40329146112660563558400), quickly dampened my enthusiasm... There must be some algorithm (dynamic programming ?), that cuts down the number of calculations involved in order to find the right

[Haskell-cafe] What algorithm to use ?

2007-10-22 Thread manu
Hello I am not sure it is appropriate to post to this mailing list to inquire about a peculiar algorithm, if not let me know... I was looking at one particular puzzle posted on the Facebook site, 'Wiretaps' (http://www.facebook.com/jobs_puzzles/?puzzle_id=11). Briefly, you have 26 program