Checkers Capture
Imagine a n-by-n chessboard, where your single checker currently stands at position (x, y) and there is pieces - a list that contains the positions of the opponent’s pawns.
Your checker may capture a piece only one step in the four diagonal directions assuming that the square behind the opponent piece in that diagonal direction is vacant. Your checker can then capture that piece by jumping over it into the vacant square, immediately removing that captured piece from the board. The chain of captures continues from the new square, potentially capturing all the pieces in one swoop.
Your function...
You should be an authorized user in order to see the full description and start solving this mission.
