A Proof of the Optimal Leapfrogging Conjecture
From MaRDI portal
Publication:6380477
arXiv2110.08319MaRDI QIDQ6380477FDOQ6380477
Authors: Sam K. Miller, Arthur T. Benjamin 
Publication date: 15 October 2021
Abstract: Suppose we have some checkers placed in the lower-left corner of a Go board, and wish to move them to the upper right corner in as few moves as possible, where the pieces move as they would in the game of Chinese Checkers. In 1993, Auslander, Benjamin, and Wilkerson generalized this game for integer lattices, defined a measure of speed for a starting configuration of pieces, and proved that a maximum speed exists, which only three configurations, called "speed-of-light" configurations can attain. It was conjectured that the maximum speed of a non-speed-of-light configuration has a smaller upper bound, which we prove.
This page was built for publication: A Proof of the Optimal Leapfrogging Conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6380477)
