Document Type



Chinese Checkers is a multi-player strategy game in which game play can become surprising complex as the game progresses. In spite of this game's complexity, questions involving games with multiple players have received little research attention. This paper considers the three player case and discusses how to describe short games. By utilizing these tendencies for short games, a heuristic function can be defined which associates a player's possible move with a heuristic value. These heuristic values guide a search algorithm which searches through all the possible moves made in a game. To guide this discussion for three player games, the results regarding single player and two player cases will be mentioned.



Thesis Comittee

Jacqueline Anderson (Thesis Director)

Shannon Lockard

Ward Heilman

Copyright and Permissions

Original document was submitted as an Honors Program requirement. Copyright is held by the author.

Included in

Mathematics Commons