Checkers
From charlesreid1
Checkers
In the Checkers problem, you are given a checkerboard with several black and white pieces arranged on the board. It is your task to answer the question of whether any one of the black pieces on the board can jump all of the white pieces on the board with a single sequence of legal moves.
To solve the checkers problem, it is important to focus on the data structure. It is possible (and interesting, and useful) to tie in the checkerboard with graph theory (spec. the Bridge of Koningsberg problem), it is also overly-complicated to construct a Graph object and decide how to populate it using logic that checks different squares, etc.
Keep it simple. Use a 2D char array.