As an alternative to plugging values into [[0,-c,b],[c,0,-a],[-b,a,0]], i tried using numpy operations. This is very slightly faster than the above.
def skew(v):
if len(v) == 4: v = v[:3]/v[3]
skv = roll(roll(diag(v.flatten()), 1, 1), -1, 0)
return skv - skv.T
I wrote a Sudoku game generator based on what I know from playing Sudoku.
it is on ActiveState.com http://goo.gl/FbDQ0
I think it’s possible that some games may have more than one solution. I don’t feel like working with it more, but one way to prevent multiple solutions is have the computer play the game a few times and throw out those that do have more than one solution. I would have to randomize the order in which play options are done. It takes me awhile to solve one by hand, so I haven’t tested it too much, but it’s good so far.
The Python Path 