  Hi all.

  Examining beta sourcepack I observe that my supose
that 7 moves was the lower limit for resolve the
puzzle.  But in Hannes's entry I have seen that with 5
movements is also possible.

  Here is my entry with 2 bytes of optimization
eliminating this 2 moves in the move table, but I have
seen the simetry of X/Y axes and use the opossite
solution. 