A Tile Moving Puzzle

The goal of tile-moving puzzles are to change one pattern into another by moving square tiles (or other markers) around on a grid. When a tile is moved, it must be moved to an empty cell where at least two of its edges will touch the edges of orthogonally adjacent tiles.
Below is a puzzle on a 4 by 4 grid (view with a fixed-width font). "#" represents a tile and " " represents an empty cell.
 From pattern:
#
  ##
  ##
    #
To pattern:
    #
  ##
  ##
#
Each move can be recorded as four numbers. The first two numbers are the coordinates of the moved tile's starting location (row number and column number). The second two numbers are the coordinates of the tile's ending location.  For example, (2,2-3,4) means move the tile at (2,2) to (3,4), and when applied this puzzle's initial state would result in:
#
   #
  ###
    #
The moves required for the sample puzzle is less than 20.
--
Carl G.
--
This email has been checked for viruses by AVG antivirus software.
www.avg.com