First Round
the input will be ab array of 64 integers which should be converted to an 8x8 matrix represent the position of a chess board with 1st row being the opponent end and last row is your end .the value in the array
0- empty
1-opponet pawns
2-your knight
3-your other pieces
your knight can move only in l shape to 3 positions ahead or behind and only to an empty square or on opponents pawns position with value 0 or 1.But opponents pawns can capture your knight if you place your knight in the immediate cross position of the pawns towards your side .based on your knights current position, you should return the list of possible position as row:col coordinate to which you can move your knight without getting captured by any of the opponent pawns ordered row and then column if no knight cannot be moved to any position return "no way"
example
input:
[0,0,0,0,0,0,0,0,
1,0,1,0,1,0,1,0,
0,1,0,1,0,1,0,1,
0,0,0,3,0,0,0,0,
0,0,0,0,3,3,3,0,
3,2,3,0,0,0,0,0,
3,3,3,0,3,0,3,0,
0,0,0,0,0,0,0,0]
output
(4:3)(6:3)(7:0)(7:2)