Problem code: MANYLEFT All submissions for this problem are
available. The classical game of OneLeft is played as follows.
Some pegs are placed on an NxN grid. Initially, at least one
cell is empty and at least one contains a peg (each cell
contains at most one peg). A move consists of jumping one peg
over an adjacent peg to an empty cell, and removing the peg that
was jumped over. Formally, if there is a peg in cell (x1, y1),
and cell (x2, y2) is empty, and (x1-x2, y1-y2) is one of (0, 2),
(0, -2), (2, 0), or (-2, 0), and there is a peg in cell
((x1+x2)/2, (y1+y2)/2), then the peg in cell (x1, y1) may be
moved to cell (x2, y2) and the peg in cell ((x1+x2)/2,
(y1+y2)/2) removed. The coordinate (0, 0) indicates the top-left
corner, (N-1, 0) indicates the top-right corner, (0, N-1)
indicates the bottom-left corner, and (N-1, N-1) indicates the
bottom-right corner. The game continues until no more moves are
possible. Normally the goal of OneLeft is to leave a single peg
on the grid. However, in this problem the