Moving checkers by a given rule to finally reverse the order
Source: ToT 2003-JO-5
June 18, 2011
combinatorics unsolvedcombinatorics
Problem Statement
checkers are placed on leftmost squares of board. Checker can either move to the empty adjacent square to its right or jump over adjacent right checker to the next square if it is empty. Moves to the left are not allowed. Find minimal such that all the checkers could be placed in the row of successive squares but in the reverse order.