Re^2: finding tuples

[Anonymous Monk]

you want the maximum number of 4 character tuples?

Not quite. The maximum number is not interesting, except the tuples make up the whole set. In other words: either a set cannot be completely decomposed, then it has no solution; or in can be completely decomposed in certain ways, then those are the solutions.

I have read the material about search paths, but I cannot see how it relates to a set. Can you tell me how I make search path out of a set?

[BioLion]

I don't have much experience in this, but i think the first thing you would need to do is work out some kind of tuple set descriptor, probably the positions of the letters if you broke them down into an array. e.g.
$paths = [$path1, $path2 ... $pathN,];

With each path being:
$path = [[1,2,3,4,],[5,8,9,11],[6,10,12,13,],[etc...]...];

You would then need a way of continuing the search path from a search path stub (i.e. a searchpath that has reached a breakpoint). After that it is a case of being really clear on what could cause a breakpoint...

I am not being very helpful here, but it is a tough question! I suspect you may need to fork the job out as you go ( Parallel::ForkManager and Introduction to Parallel::ForkManager ) and recombine their output ( IPC::Shareable )