Your job is to solve this chess-related game.
The setup of the game is a 7x7 tile grid, you start on a random tile and you have to hop on each tile, until you hopped on all 49 tiles.
Top left corner is (0,0)
- you can hop on each tile once.
- the only move allowed in the game is to hop two tiles horizontally and one tiles vertically, or two tiles vertically and one tiles horizontally, like a knight in a chess game.
- your input should be a tuple representing the coordinates of the starting tile (stdin, file, what you prefer).
- your output a list of tuples, representing the coordinates of each hop. If there's no valid combinations, return an empty list (same as above, any output is ok).
This is code-golf, so shortest code wins!