I've ran quite a few tests using faster languages than SQL. It's clear
to me that you could build a table of contents, of about at max
(~(9!)^6), and simply select out the matching pair, you can even fix
the first row to 123456789, and then use substition, transposition and
boxrow and column transposition to reduce the count. There's so many
dimensions of symmetry in the structure, that I'm sure I could come up
with a manageable array size. (In fact I might have a go at it this
evening.)

Unfortunately I don't have access to the Maryland supercomputer array,
so I have to put up with not being able to test this.

There are plenty of other fast ways of solving it, though.

The sheer joy of programming is the reason men do it, the sheer joy of
talking is why women don't.

Are we learning Patricia Hewitt?



--- UseNet To RIME Gateway {at} 3/31/05 8:49:33 AM ---