S.D.Mechveliani wrote: > Thus, the recent example with the Cryptarithm solver was a very > in-correct comparison, due to the unknown permutation generating > order. I did not study the problem in detail, but I think giving it an unsolvable puzzle would force it to try *all* permutations, thus eliminating the order problem. Ralf
- Haskell's efficiency S.D.Mechveliani
- Re: Haskell's efficiency Marcin 'Qrczak' Kowalczyk
- Re: Haskell's efficiency Ralf Muschall
- Re: Haskell's efficiency Manuel M. T. Chakravarty
- Re: Haskell's efficiency Jonathan King
- Re: Haskell's efficiency Marcin 'Qrczak' Kowalczyk
- Re: Haskell's efficiency Marko Schuetz
- Re: Haskell's efficiency Oege de Moor