KöMaL 2008 K173

A knight is to be transferred from C5 to H2 on the chessboard with the smallest possible number of moves. How many steps does this way consist of? Find 12 several minimal ways. (A move means two squares in one direction and then one square at an angle of $90^o$.)