Not the most elegant solution, (and the print out is sloppy), but it was developed in 3 minutes (I already had the Anagrammer class written....) I spent half the day trying to do it by hand, just to see it I could. No such luck, so I threw this code together [ June 06, 2003: Message edited by: Joel McNary ]
Joined: Oct 14, 2002
Joel, Michael, Greg - WOW !!! You guys did that fast!!! A lot faster than I did it (which may be damned by faint praise ), I seem to recall some sort of recursive solution... A friend once described his very elegant high level design for the 'knight's tour' problem, which I'll post next.