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
    9 Citations

    Figures, Tables, and Topics from this paper

    Explore Further: Topics Discussed in This Paper

    Optimizing a Game of Chinese Checkers
    • 2
    Analyzing the sophistication of Chinese checkers
    Minimizing Writes in Parallel External Memory Search
    • 17
    • PDF
    Congruences for Overpartition k-tuples
    • S. Chen
    • Mathematics, Computer Science
    • Integers
    • 2010
    • 2
    • PDF
    Optimizing a Game of Chinese Checkers

    References

    SHOWING 1-10 OF 25 REFERENCES
    Breadth-first heuristic search
    • 230
    • PDF
    Artificial Intelligence: A Modern Approach
    • 24,674
    • PDF
    Distance on a Hexagonal Grid
    • 112
    Wheels, life, and other mathematical amusements
    • 207
    Bridg-it and other Games
    • New Mathematical Diversions, 210–18, MAA, 1995
    • 1961
    Halma and Chinese Checkers: Origins and Variations
    • Board Games in Academia, Editions Universitaires Fribourg Suisse
    • 2002
    Halma and Chinese Checkers: Origins and Variations, in Board Games in Academia, Editions Universitaires Fribourg Suisse
    • Halma and Chinese Checkers: Origins and Variations, in Board Games in Academia, Editions Universitaires Fribourg Suisse
    • 2002
    Mathematics Magazine
    • Mathematics Magazine
    • 1993
    Optimal Leapfrogging
    • Mathematics Magazine 66
    • 1993