Minimax Self Playing Game Alquerque

Abstract

Playing game in a computer is always fascinating and entertaining. But playing against a computer player is much more fun and challenging than a human player. We have proposed a simple algorithm for playing a repeated game named Alquerque in this paper. We show that by following this algorithm it is proved that the game playing strategy tends to minimum loss and maximum win against the human. Our analysis is the evidence of minimax search theorem and well-chosen combination of probability for solving this game. In this paper we have developed an intelligent computer player successfully that uses min-max search technique, strategy utility function which leads to win and draw in the worst scenario for playing the ancient game Alquerque.