Posted by Adrian on July 21, 19100 at 03:45:41:
good morning,
i'm planning to do a small java/c++ program that calculates every possible combination of squares, where the the cells are numbered in the following fashion: for instance, a 3*3 square is numbered from 1->9.
1 2 3
4 5 6
7 8 9 ...and so forth.
so... basically, i need an algorithm, that upon returning to its original state should have tried every possible numbercombination.
cheers,
//adīrian.
btw, if you have access to email, pleae email me instead.