![]() ![]() The most interesting step taken, also the most relevant regarding what we’ve learned in this course, is the utilization of the Minimax algorithm for building an AI program that determines and plays the most advantageous move at each turn. In the study, several steps were taken to understand the game intuitively and search for an optimal strategy. Image of Nine Men’s Morris Board with Twenty-Four Spaces. A player wins the game when the opponent has less than three pieces left on the board or cannot move any pieces (The Rules of Merels or Nine Men’s Morris, ). Once all pieces have been placed on the board, each player will take turns to move one of their on-the-board pieces to a different space in an attempt to achieve a mill. When a player achieves a mill, they are to steal and remove any one of the opponent’s pieces on the board that is not part of the mill (Note: a mill can only be a vertical or horizontal row). ![]() Player “white” always moves first, and the players start taking turns placing one of their nine pieces onto an open space on the board the objective here is to achieve a “mill”, which is a term for a connected row of three pieces (The Rules of Merels or Nine Men’s Morris, ). The Nine Men’s Morris game involves a board with twenty-four spaces (depicted as “dots” or intersections on the board as seen below), and each player is given nine pieces each to place on the board (Boyd & Hirunthanakorn 2). In 2012, a study was done by Martin Boyd and Christopher Hirunthanakorn on the game of Nine Men’s Morris – a board game played between two players – in order to find an optimal strategy that could ideally guarantee a win or a draw. Game Theory Application to Nine Men’s Morris
0 Comments
Leave a Reply. |