Agon (or Queen's Guards or Royal Guards) is an strategy game invented by Anthony Peacock of London, and first published in 1842. It is a two player ga...
Agon (or Queen's Guards or Royal Guards) is an strategy game invented by Anthony Peacock of London, and first published in 1842. It is a two player game played on a 6×6×6 hexagonal gameboard, and is notable for being the oldest known board game played on a board of hexagonal cells.
Each player has one queen and six guards. Players determine who moves first, then turns alternate. On each turn, a player moves one of his pieces. The object of the game is to be first to maneuver one's queen to the central hex (the throne) at the center of the board, and surround her with all six of her guards.
The gameboard may be thought of as a series of concentric rings of hex cells (highlighted by rings of alternating colors). Pieces move one step at a time to an adjacent cell, either sideways in the same ring, or towards the throne to the next ring. The cell moved to must be vacant. Only the queen may move to the throne.
VS
KALAH
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...
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.
Comments (0)
No comments yet. Be the first to share your thoughts!