A Note on the Iterative Algorithm for the Reve's Puzzle

An iterative algorithm based on the divide-and-conquer appraoch has been presented by van de Liefvoort for the Reve's puzzle. This note justifies the method suggested by Liefvoort to determine the number and sizes of the optimal slices, each of which can be moved in some iterative algorithm of the three-peg problem