GIPF VS KALAH

GIPF is an abstract strategy board game by Kris Burm, the first of six games in his series of games called the GIPF Project. GIPF was recommended by Spiel des Jahres in 1998. Players take turns pushing tokens (one player taking black, the other white) from the edge of the tri-gridded, hexagonal board, with pieces already in play pushed in front of the new placements rather than allowing more than one piece on any space. The game is lost if a player has no more tokens to play, and since each starts with a set number of tokens, it is clearly necessary to recycle pieces already positioned to keep playing. This is achieved by contriving to line up four pieces of the same colour in a row on the board, at which point those tokens are returned to their owner, and any opposing tokens extending from the line of four are captured. Because a single player will often move several pieces and change numerous on-board relationships, it is remarkably difficult to predict the state of the board more than one turn ahead, despite GIPF being a game of perfect information. Play tends to be highly fluid and there is no real concept of long term territorial or spatial development. The game can be expanded with extra pieces (available separately) called Potentials, which allow different kinds of moves to be made. These are named for the other games in the GIPF Project, though the other games are not actually necessary in order to utilise the Potentials named after them.

مشاهدة الإحصائيات

Kalah, also called Kalaha or Mancala, is a game in the mancala family invented in the United States by William Julius Champion, Jr. in 1940. This game is sometimes also called "Kalahari", possibly by false etymology from the Kalahari desert in Namibia. As the most popular and commercially available variant of mancala in the West, Kalah is also sometimes referred to as Warri or Awari, although those names more properly refer to the game Oware. For most of its variations, Kalah is a solved game with a first-player win if both players play perfect games. The Pie rule can be used to balance the first-player's advantage. Mark Rawlings has written a computer program to extensively analyze both the "standard" version of Kalah and the "empty capture" version, which is the primary variant. The analysis was made possible by the creation of the largest endgame databases ever made for Kalah. They include the perfect play result of all 38,902,940,896 positions with 34 or fewer seeds. In 2015, for the first time ever, each of the initial moves for the standard version of Kalah(6,4) and Kalah(6,5) have been quantified: Kalah(6,4) is a proven win by 8 for the first player and Kalah(6,5) is a proven win by 10 for the first player. In addition, Kalah(6,6) with the standard rules has been proven to be at least a win by 4. Further analysis of Kalah(6,6) with the standard rules is ongoing. For the "empty capture" version, Geoffrey Irving and Jeroen Donkers (2000) proved that Kalah(6,4) is a win by 10 for the first player with perfect play, and Kalah(6,5) is a win by 12 for the first player with perfect play. Anders Carstensen (2011) proved that Kalah(6,6) was a win for the first player. Mark Rawlings (2015) has extended these "empty capture" results by fully quantifying the initial moves for Kalah(6,4), Kalah(6,5), and Kalah(6,6). With searches totaling 106 days and over 55 trillion nodes, he has proven that Kalah(6,6) is a win by 2 for the first player with perfect play. This was a surprising result, given that the "4-seed" and "5-seed" variations are wins by 10 and 12, respectively. Kalah(6,6) is extremely deep and complex when compared to the 4-seed and 5-seed variations, which can now be solved in a fraction of a second and less than a minute, respectively.

مشاهدة الإحصائيات