[old] Chess Knight [old] Chess Knight
English RU

Your friend loves chess very much, but he's not a strong player. You can help him by using your programming skills.
If this mission is too simple for you, try another one from this set - The shortest Knight's path.

Your task is to write a function that can find all of the chessboard cells to which the Knight can move. The input data will consist...
If the same cell appears more than once - do not add it again. You should return the list of all of the possible cells and sort them as follows: in alphabetical order (from 'a' to 'h') and in ascending order (from 'a1' to 'a8' and so on).

You should be an authorized user in order to see the full description and start solving this mission.