twitter ]]>

I want to use it so that I can use it for coding my Passwords so that it would be harder to be deciphered.

Thanks for this writing this blog.

]]>You say that the last step is due to symmetry but that doesn’t mean much when you assume the thing it is asking you to prove. Hence the proof is invalid. ]]>

L := []:

T := combinat:-cartprod([seq([1, 2, 3, 4], i = 1 .. 4)]):

while `not`(T[finished]) do L := [op(L), Matrix(2, 2, T[nextvalue]())] end do:

select(proc (x) LinearAlgebra:-Equal(`mod`(Transpose(x).Matrix([[2, 0], [0, 3]]).x, 5), IdentityMatrix(2)) end proc, L);

“…&& position.getPiece(lastMove.getToSqi()) == Chess.ROOK)…”

Given that we’ve found our solution, wouldn’t the getPiece method always return KNIGHT on this square, since the position is the final (checkmate) position?

Thanks.

]]>