Awari
Awari,
a variation of the two-player abstract strategy mancala board game Oware or Awele. Awari was played five times at Computer Olympiads, from the 1st Computer Olympiad in 1989 until the 5th Computer Olympiad in 2000.
Contents
It's a Draw
In 1990, Victor Allis, Maarten van der Meulen, and Jaap van den Herik first applied retrograde analysis to Awari [2], in 2000 and 2002 further elaborated by Roel van der Goot [3] and Thomas Lincke respectevely [4]. Awari was strongly solved by John Romein and Henri Bal in 2002 - either side can force a draw [5]. They developed a program that computes the best move and eventual outcome for all 889,063,398,406 positions that can possibly occur in Awari and further published a Java applet to play against their Awari Oracle, a potentially infallible opponent. The database requires 778 GiB stored on disk and was generated using parallel retrograde analysis with a cluster of 72 dual PIII @ 1 GHz with 1 GiB of main memory each, connected through Myrinet, which took 51 hours [6].
Rules
Owari or Awari is played on a board that contains two rows or depending on the layout, sectors of six pits called "houses", in which seeds (pieces or stones) are kept. Each player owns one of the rows. The game starts with four seeds in each pit. When a player is to move, he chooses one of his own nonempty pits, takes all seeds from it, and sows them one by one, counterclockwise over the remaining pits, skipping the emptied pit if there are more than 11 seeds. If the last seed ends in an opponent’s pit and contains two or three seeds after sowing, they are captured. If the second last pit holds the same conditions, they are captured as well, and so on. The objective of the game is to capture more than 24 seeds. The player must give the opponent a countermove, unless no such move is available. If a player cannot move, the remaining seeds are captured by the opponent. A repeated position leads to an even division of the remaining stones, ending the game [7]. The rules slightly differ from one country to another. For example, the "grand slam rule", which states what happens if all opponent’s pieces are captured in a single move (if allowed at all !) comes in many variants. The rules of computer-aided play of Awari concerning repetitions, captures and leaving the opponent without countermove [8] were defined by Victor Allis, Maarten van der Meulen, and Jaap van den Herik in 1991 [9]
Computer Olympiads
- 1st Computer Olympiad, London 1989
- 2nd Computer Olympiad, London 1990
- 3rd Computer Olympiad, Maastricht 1991
- 4th Computer Olympiad, London 1992
- 5th Computer Olympiad, London 2000
See also
Selected Publications
1989
- Jean Retschitzki (1989). Evidence of Formal Thinking in Baoule Awele Players. in Heterogenity in Cross-cultural Psychology. Swets Zeitlinger, Amsterdam
1990 ...
- Maarten van der Meulen, Victor Allis, Jaap van den Herik (1990). Lithidion: an Awari-playing Program. Technical Report 90-05, University of Limburg
- Victor Allis, Maarten van der Meulen, Jaap van den Herik (1990). Databases in Awari. Technical Report CS-90-5, University of Limburg
- Victor Allis, Maarten van der Meulen, Jaap van den Herik (1991). Omniscience in Lithidion. Heuristic Programming in Artificial Intelligence 2
- Victor Allis, Maarten van der Meulen, Jaap van den Herik (1991). Databases in Awari. Heuristic Programming in Artificial Intelligence 2
2000 ...
- Jack van Rijswijck (2000). Learning from Perfection: A Data Mining Approach to Evaluation Function Learning in Awari. CG 2000, pdf
- Roel van der Goot (2000). Awari Retrograde Analysis. CG 2000
- Thomas Lincke, Ambros Marzetta (2000). Large Endgame Databases with Limited Memory Space. ICGA Journal, Vol. 23, No. 3
- Thomas Lincke, Roel van der Goot (2000). Marvin Wins Awari Tournament. ICGA Journal, Vol. 23, No. 3
- Jean Retschitzki (2000). Strategies of Expert Awele Players. International Colloquium "Board Games in Academia III". Florence
- Thomas Lincke (2002). Exploring the Computational Limits of Large Exhaustive Search Problems. Ph.D thesis, ETH Zurich, pdf » Repetitions [10]
- John Romein, Henri Bal (2002). Awari is Solved. ICGA Journal, Vol. 25, No. 3
- Jeroen Donkers (2002). Comments on the Awari Solution. ICGA Journal, Vol. 25, No. 3
- John Romein, Henri Bal (2003). Solving the Game of Awari using Parallel Retrograde Analysis. IEEE Computer, Vol. 36, No. 10
Forum Posts
- Awari? by Darse Billings, rgc, August 21, 1992
- awari macala by Eric van Riet Paap, rgc, December 05, 1994
External Links
- Awari (ICGA Tournaments)
- Awari Oracle - Mancala World - Wikia
- Oware - Mancala World - Wikia
- Oware from Wikipedia
- Ayoayo from Wikipedia
- Oware - Played all over the world
- Awari by Oswin Aichholzer (German)
- Toto - Africa (Falling in Between Live), March 26, 2007, Le Zénith, Paris, YouTube Video
- lineup: Steve Lukather, Bobby Kimball, Greg Phillinganes, Simon Phillips, Leland Sklar, Tony Spinner
References
- ↑ Front side of owari game variant, possibly made in Cameroon. CC BY-SA 3.0, Wikimedia Commons, Oware from Wikipedia
- ↑ Victor Allis, Maarten van der Meulen, Jaap van den Herik (1990). Databases in Awari. Technical Report CS-90-5, University of Limburg
- ↑ Roel van der Goot (2000). Awari Retrograde Analysis. CG 2000
- ↑ Thomas Lincke (2002). Exploring the Computational Limits of Large Exhaustive Search Problems. Ph.D thesis, ETH Zurich
- ↑ John Romein, Henri Bal (2002). Awari is Solved. ICGA Journal, Vol. 25, No. 3
- ↑ Awari Oracle - Mancala World - Wikia
- ↑ John Romein, Henri Bal (2002). Awari is Solved. ICGA Journal, Vol. 25, No. 3
- ↑ Awari Oracle - Mancala World - Wikia
- ↑ Victor Allis, Maarten van der Meulen, Jaap van den Herik (1991). Databases in Awari. Heuristic Programming in Artificial Intelligence 2
- ↑ Re: Aquarium IDEA, repetitions, and minimax over cycles by syzygy, OpenChess Forum, September 22, 2012
