1. Senior Project Poster Day 2007, CIS Dept. University of Pennsylvania Reversi Meng Tran Faculty Advisor: Dr. Barry Silverman Strategies: l Corners t Corners are marked with an X and dangerous squares are marked with an O. t Corners can not be flanked which can give you an edge since it can flip pieces across the diagonal of the board or to another corner. t Squares around the corner are dangerous as it might give your opponent access to the corner. l Edges t Edges are the squares on the top and bottom rows and leftmost and rightmost columns (marked with an X). t Edges like corners gives the most potential in flipping the most pieces across the board. t Edges are harder to flank as the only places that can flank an edge is another edge. l Mobility t One of the hardest strategies to pull off. t Limits your opponent’s moves by planning ahead. t Gains an extra move and also limits the squares your opponent can play. t Extremely advantageous, but easier to pull off in the later stages of the game. l End Game t At the end of the game, when 8 to 12 squares are left anybody can perform a look-ahead to see which squares are most advantageous. t Can predict where your opponent might move after you. t Would be able to estimate if you can win with certain moves. t Since there are only a few steps left, simulating each move would not be too difficult. t Less time simulating what would happen. Abstract: l The purpose of this project was to explore the field of artificial intelligence using Reversi. Brief History: l Reversi was invented around 1880 by Englishmen, Lewis Waterman and John W. Mollett. l Mattel produced the game Reversi under the name Othello. l Mattel was probably referencing the conflict in Shakespeare's play. l Since 1978 there has been a World Othello Championship. Rules: l The game starts with 2 pieces of each color in the center: Black on E4, D5 and White on E5, D4. l Each player takes alternate turns with Black going first. l Each move must flank one of your opponent’s color. There must be at least one of your opponent’s chip between your current move and one of your existing chip on the board. l The flanked chips changes to your color. l Each player must move if a valid move exists on the board. l If a valid move does not exist then the player must forfeit the turn. l The game ends when neither player can make a valid move on the board either because there is no more room or no valid moves exist. l The player with the most chips on the board wins. Approach: l Simple strategy l Instead of randomly choosing a square for the default computer opponent, I used a priority matrix developed by Peter Frey. l The top priority is 1 and lowest is 60. Smart AI: l The Smart AI option plays using the End Game strategy. l It uses a 12 step look-ahead. l Simulates the game and returns a heuristic of 1 for win, -1 for loses, and 0 for draws. l Each node sums up the heuristic of all its children. l The move with the highest heuristic value is the best possible move with the most chances of ending in a win. Conclusions: l This extensive depth-first search can only be done near the end of the game as it takes a lot of time and space. l Smart AI does not take into account Frey’s weights, thus giving the opponent the upper hand when it comes to corners. l End Game is not perfect unless it takes into account the position’s weight. l Future research should go into the beginning of the game where the search branches are extremely long. Black moves E6 flanking Whites E5, thus flipping it to Black New Game 149517186502 5157413334425852 74313252614448 193527283620 213729303822 945153132164610 5359473940486054 35511232012564