I was trying to wrap this KenKen thing up and get my work day started, so I kind of breezed over the Cornell article that I linked to, which explicitly states in the last paragraph:

It turns out that this is the beginning of a math problem that isn’t done. The boards that we have talked about here go by the name latin squares. One problem that mathematicians don’t know an answer to is how many nxn latin squares there are, that is, how many ways there are of filling in of an nxn board with the numbers 1 to n appearing exactly once in each row and column, there are for an arbitrary n.

It looks like the answer I was looking for (all combinations of the 6×6 board) is actually *812,851,200*. Still, no shortage of KenKen fun here!

For more Latin Squares reading, check it out on Wikipedia: http://en.wikipedia.org/wiki/Latin_square

Thanks to my buddy jdp for double checking me.

]]>