From:

Date:

July 25, 2003 11:25Subject:

Was Fun - Each character at most onceMessage ID:

20030725182324.GA13971@glympton.airtime.co.ukQuoting A. Pagaltzis (pagaltzis@gmx.de): > I don't see the problem. You have 36 (or 120) pairs or encoded > characters to allocate, and up to that many input characters. > Looks like just one straightforward mapping. The problem is that there are 371993326789901217467999448150835200000000 possible arrangements of the 36 characters. If most of those work then you'll find one pretty quickly, but if there's only one solution, it'll take something like a million million million million years to find it with a brute force approach. I've thought of some ways of making a brute-force approach a bit smarter and reduce the search space a bit, but I haven't found a quick way of determining if there's a solution or not. For now, the only way to determine that something like print"............................." is unencodable is to try every possible arrangement of characters. Adam -- Adam Rice -- adamrice@ntlworld.com -- Blackburn, Lancashire, England

- RE: Was Fun - Each character at most once by Alistair.McGlinchy
- Fun - Each character at most once by Richard Proctor
- RE: Fun - Each character at most once by Alistair.McGlinchy
- Re: Fun - Each character at most once by Eugene van der Pijll
- Re: Fun - Each character at most once by A. Pagaltzis
- Re: Fun - Each character at most once by Adam Rice
- Re: Fun - Each character at most once by A. Pagaltzis
**Was Fun - Each character at most once**by Adam Rice- Re: Was Fun - Each character at most once by James E. Tilley
- Re: Was Fun - Each character at most once by Adam Rice
- RE: Fun - Each character at most once by Alistair.McGlinchy
- Re: Fun - Each character at most once by =?ISO-8859-1?Q?Steffen_M=FCller?=
- Re: Fun - Each character at most once by Ronald J Kimball

nntp.perl.org: Perl Programming lists via nntp and http.

Comments to Ask Bjørn Hansen at ask@perl.org | Group listing | About