• DOI:10.1515/INTEG.2009.003
Corpus ID: 17141575

The Shortest Game of Chinese Checkers and Related Problems

@inproceedings{Bell2008TheSG,
  title={The Shortest Game of Chinese Checkers and Related Problems},
  author={G. I. Bell},
  booktitle={ArXiv},
  year={2008}
}

G. I. Bell

Published in ArXiv 2008

Mathematics, Computer Science

Abstract In 1979, David Fabian found a complete game of two-person Chinese Checkers in 30 moves (15 by each player). This solution requires that the two players cooperate to generate a win as quickly as possible for one of them. We show, using computational search techniques, that no shorter game is possible. We also consider a solitaire version of Chinese Checkers where one player attempts to move her pieces across the board in as few moves as possible. In 1971, Octave Levenspiel found a… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed