In this work, we present an approach that effectively combines the use of heuristics, Monte Carlo Tree Search (MCTS), and reinforcement learning for building a Chinese Checkers agent without the use of any human game-play data. First, checkers in the game remain indefinitely on the board and cannot be captured and second, the possibility of repetition and backward movements of checkers mean that the game can be arbitrarily long without violating game rules. In addition, with the goal to move all of a player’s checkers to the opponent’s side, there are two particular aspects of the game that are different from other traditional games which may lead to an enormously large game-tree and state-space complexity (Allis, 1994) and game divergence. While there are known strategies for approaching Chinese Checkers, such strategies often only focus on the initial starting policy and locally optimal game-play patterns, or that they may heavily rely on cooperation between the players, which is often not possible. Little research attention, however, has been drawn to solve the game of Chinese Checkers with machine learning techniques. In developing machine learning algorithms that excel at traditional zero-sum board games of perfect information, such as Chess (Silver et al., 2017a Thrun, 1995) and Go ( Silver et al., 2017b), as well as other games (Lagoudakis & Parr, 2003 Waugh & Bagnell, 2015 Conitzer & Sandholm, 2003 Pendharkar, 2012 Guo et al., 2014 Stanley et al., 2006 Finnsson & Björnsson, 2008 Chen et al., 2017). So even if the player keeps one marble in the home point, the opponent can win by occupying the remaining nine spots.There have been many successes (Silver et al., 2017a, b, 2016 Khalifa et al., 2016) The simplest rule to prevent this strategy states that the player wins when all available spots are filled in the destination point. In fact, some players modify the basic rules of chinese checkers to prevent use of this strategy. Generally speaking, this strategy is considered “unsportsmanlike”. Of course, the player using this strategy cannot win since they ultimately must move that marble across the board to score victory. They keep a marble in their home point to prevent their opponent from moving all their marbles into that point. Some players use a defensive strategy to prevent victory by their opponent.
#Strategies for chinese checkers for free
For practice, you can play for free here. By playing against a computer foe you will learn from watching its moves, as well as be challenged to play your best. Computer players usually move their marbles efficiently and logically, by analyzing future moves. The easiest and fastest way to learn to play chinese checkers well is to play practice games against a computer opponent. Improve your skills by practicing against computer opponents Always look to jump your last marble forward so it doesn’t get left behind.
Generally you will find that you will have more jumping opportunites and will advance faster this way. When advancing your marbles, move them as a group. This marble may be moved one space outward or, more commonly, inward toward the center of the board. If you watch good chinese checkers players or computerized chinese checkers players, you wil notice that they almost always start the game by moving one of the two marbles located at the ends of the front row.
0 kommentar(er)
