25,161
edits
Changes
Created page with "'''Home * Games * Awari''' FILE:Owari-front.jpg|border|right|thumb|Front side of owari game variant <ref>Front side of owari game variant, possibly made i..."
'''[[Main Page|Home]] * [[Games]] * Awari'''
[[FILE:Owari-front.jpg|border|right|thumb|Front side of owari game variant <ref>Front side of owari game variant, possibly made in [https://en.wikipedia.org/wiki/Cameroon Cameroon]. [https://creativecommons.org/licenses/by-sa/3.0/deed.en CC BY-SA 3.0], [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons], [https://en.wikipedia.org/wiki/Oware Oware from Wikipedia]</ref> ]]
'''Awari''', <br/>
a [https://en.wikipedia.org/wiki/Awari#.22Grand_Slam.22_variations variation] of the [https://en.wikipedia.org/wiki/Two-player_game two-player] [https://en.wikipedia.org/wiki/Abstract_strategy_game abstract strategy] [[Games#Mancala|mancala board game]] [https://en.wikipedia.org/wiki/Oware Oware] or Awele. Awari was played five times at [[Computer Olympiad|Computer Olympiads]], from the [[1st Computer Olympiad]] in 1989 until the [[5th Computer Olympiad]] in 2000.
=It's a Draw=
In 1990, [[Victor Allis]], [[Maarten van der Meulen]], and [[Jaap van den Herik]] first applied [[Retrograde Analysis|retrograde analysis]] to Awari <ref>[[Victor Allis]], [[Maarten van der Meulen]], [[Jaap van den Herik]] ('''1990'''). ''Databases in Awari''. Technical Report CS-90-5, [[Maastricht University|University of Limburg]]</ref>, in 2000 and 2002 further elaborated by [[Roel van der Goot]] <ref>[[Roel van der Goot]] ('''2000'''). ''[http://link.springer.com/chapter/10.1007/3-540-45579-5_6 Awari Retrograde Analysis]''. [[CG 2000]]</ref> and [[Thomas Lincke]] respectevely <ref>[[Thomas Lincke]] ('''2002'''). ''Exploring the Computational Limits of Large Exhaustive Search Problems''. Ph.D thesis, [[ETH Zurich]]</ref>. Awari was [[Solved Game|strongly solved]] by [[John Romein]] and [[Henri Bal]] in 2002 - either side can force a draw <ref>[[John Romein]], [[Henri Bal]] ('''2002'''). ''Awari is Solved''. [[ICGA Journal#25_3|ICGA Journal, Vol. 25, No. 3]]</ref>. 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]] [https://en.wikipedia.org/wiki/Java_applet 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 [https://en.wikipedia.org/wiki/Computer_cluster cluster] of 72 dual [[x86|PIII]] @ 1 GHz with 1 GiB of [[Memory|main memory]] each, connected through [https://en.wikipedia.org/wiki/Myrinet Myrinet], which took 51 hours <ref>[http://mancala.wikia.com/wiki/Awari_Oracle Awari Oracle - Mancala World - Wikia]</ref>.
=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 [[Repetitions|repeated position]] leads to an even division of the remaining stones, ending the game <ref>[[John Romein]], [[Henri Bal]] ('''2002'''). ''[http://ticc.uvt.nl/icga/journal/contents/content25-3.htm#AWARI%20IS%20SOLVED Awari is Solved]''. [[ICGA Journal#25_3|ICGA Journal, Vol. 25, No. 3]]</ref>. The rules slightly differ from one country to another. For example, the "[https://en.wikipedia.org/wiki/Awari#.22Grand_Slam.22_variations 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 <ref>[http://mancala.wikia.com/wiki/Awari_Oracle Awari Oracle - Mancala World - Wikia]</ref> were defined by [[Victor Allis]], [[Maarten van der Meulen]], and [[Jaap van den Herik]] in 1991 <ref>[[Victor Allis]], [[Maarten van der Meulen]], [[Jaap van den Herik]] ('''1991'''). ''Databases in Awari''. [[2nd Computer Olympiad|Heuristic Programming in Artificial Intelligence 2]]</ref>
=[[Computer Olympiad|Computer Olympiads]]=
* [[1st Computer Olympiad#Awari|1st Computer Olympiad, London 1989]]
* [[2nd Computer Olympiad#Awari|2nd Computer Olympiad, London 1990]]
* [[3rd Computer Olympiad#Awari|3rd Computer Olympiad, Maastricht 1991]]
* [[4th Computer Olympiad#Awari|4th Computer Olympiad, London 1992]]
* [[5th Computer Olympiad#Awari|5th Computer Olympiad, London 2000]]
=See also=
* [[Bao]]
* [[Kalah]]
=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, [[Maastricht University|University of Limburg]]
* [[Victor Allis]], [[Maarten van der Meulen]], [[Jaap van den Herik]] ('''1990'''). ''Databases in Awari''. Technical Report CS-90-5, [[Maastricht University|University of Limburg]]
* [[Victor Allis]], [[Maarten van der Meulen]], [[Jaap van den Herik]] ('''1991'''). ''Omniscience in Lithidion''. [[2nd Computer Olympiad#Workshop|Heuristic Programming in Artificial Intelligence 2]]
* [[Victor Allis]], [[Maarten van der Meulen]], [[Jaap van den Herik]] ('''1991'''). ''Databases in Awari''. [[2nd Computer Olympiad#Workshop|Heuristic Programming in Artificial Intelligence 2]]
==2000 ...==
* [[Jack van Rijswijck]] ('''2000'''). ''[http://link.springer.com/chapter/10.1007/3-540-45579-5_8 Learning from Perfection: A Data Mining Approach to Evaluation Function Learning in Awari]''. [[CG 2000]], [http://sites.google.com/site/javhar1/LearningFromPerfection.pdf pdf]
* [[Roel van der Goot]] ('''2000'''). ''[http://link.springer.com/chapter/10.1007/3-540-45579-5_6 Awari Retrograde Analysis]''. [[CG 2000]]
* [[Thomas Lincke]], [[Roel van der Goot]] ('''2000'''). ''Marvin Wins Awari Tournament''. [[ICGA Journal#23_3|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]], [http://e-collection.library.ethz.ch/eserv/eth:25905/eth-25905-02.pdf pdf] » [[Repetitions]] <ref>[http://www.open-chess.org/viewtopic.php?f=5&t=2093#p17469 Re: Aquarium IDEA, repetitions, and minimax over cycles] by [[Ronald de Man|syzygy]], [[Computer Chess Forums|OpenChess Forum]], September 22, 2012</ref>
* [[John Romein]], [[Henri Bal]] ('''2002'''). ''[http://ticc.uvt.nl/icga/journal/contents/content25-3.htm#AWARI%20IS%20SOLVED Awari is Solved]''. [[ICGA Journal#25_3|ICGA Journal, Vol. 25, No. 3]]
* [[Jeroen Donkers]] ('''2002'''). ''[http://ticc.uvt.nl/icga/journal/contents/content25-3.htm#COMMENTS%20ON%20THE%20AWARI%20SOLUTION Comments on the Awari Solution]''. [[ICGA Journal#25_3|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=
* [https://groups.google.com/d/msg/rec.games.chess/xAt5XlwwfAo/AMFWFZMYqYAJ Awari?] by [[Darse Billings]], [[Computer Chess Forums|rgc]], August 21, 1992
* [https://groups.google.com/d/msg/rec.games.chess/jiWscU23jZQ/ype2R9nZjNYJ awari macala] by [[Eric van Riet Paap]], [[Computer Chess Forums|rgc]], December 05, 1994
=External Links=
* [https://www.game-ai-forum.org/icga-tournaments/game.php?id=16 Awari (ICGA Tournaments)]
* [http://mancala.wikia.com/wiki/Awari_Oracle Awari Oracle - Mancala World - Wikia]
* [http://mancala.wikia.com/wiki/Oware Oware - Mancala World - Wikia]
* [https://en.wikipedia.org/wiki/Oware Oware from Wikipedia]
* [https://en.wikipedia.org/wiki/Ayoayo Ayoayo from Wikipedia]
* [http://www.oware.org/history.asp Oware - Played all over the world]
* [http://www.ist.tugraz.at/staff/aichholzer/games/awari.html Awari] by [[Oswin Aichholzer]] (German)
* [[Videos#Toto|Toto]] - [https://en.wikipedia.org/wiki/Africa_(Toto_song) Africa] ([https://en.wikipedia.org/wiki/Falling_in_Between_Live Falling in Between Live]), March 26, 2007, [https://en.wikipedia.org/wiki/Le_Z%C3%A9nith_(Paris,_France) Le Zénith, Paris], [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: lineup: [https://en.wikipedia.org/wiki/Steve_Lukather Steve Lukather], [https://en.wikipedia.org/wiki/Bobby_Kimball Bobby Kimball], [https://en.wikipedia.org/wiki/Greg_Phillinganes Greg Phillinganes], [[Videos#SimonPhillips|Simon Phillips]], [https://en.wikipedia.org/wiki/Leland_Sklar Leland Sklar], [https://en.wikipedia.org/wiki/Tony_Spinner Tony Spinner]
: {{#evu:https://www.youtube.com/watch?v=aymnC9PR7AQ|alignment=left|valignment=top}}
=References=
<references />
'''[[Games|Up one Level]]'''
[[FILE:Owari-front.jpg|border|right|thumb|Front side of owari game variant <ref>Front side of owari game variant, possibly made in [https://en.wikipedia.org/wiki/Cameroon Cameroon]. [https://creativecommons.org/licenses/by-sa/3.0/deed.en CC BY-SA 3.0], [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons], [https://en.wikipedia.org/wiki/Oware Oware from Wikipedia]</ref> ]]
'''Awari''', <br/>
a [https://en.wikipedia.org/wiki/Awari#.22Grand_Slam.22_variations variation] of the [https://en.wikipedia.org/wiki/Two-player_game two-player] [https://en.wikipedia.org/wiki/Abstract_strategy_game abstract strategy] [[Games#Mancala|mancala board game]] [https://en.wikipedia.org/wiki/Oware Oware] or Awele. Awari was played five times at [[Computer Olympiad|Computer Olympiads]], from the [[1st Computer Olympiad]] in 1989 until the [[5th Computer Olympiad]] in 2000.
=It's a Draw=
In 1990, [[Victor Allis]], [[Maarten van der Meulen]], and [[Jaap van den Herik]] first applied [[Retrograde Analysis|retrograde analysis]] to Awari <ref>[[Victor Allis]], [[Maarten van der Meulen]], [[Jaap van den Herik]] ('''1990'''). ''Databases in Awari''. Technical Report CS-90-5, [[Maastricht University|University of Limburg]]</ref>, in 2000 and 2002 further elaborated by [[Roel van der Goot]] <ref>[[Roel van der Goot]] ('''2000'''). ''[http://link.springer.com/chapter/10.1007/3-540-45579-5_6 Awari Retrograde Analysis]''. [[CG 2000]]</ref> and [[Thomas Lincke]] respectevely <ref>[[Thomas Lincke]] ('''2002'''). ''Exploring the Computational Limits of Large Exhaustive Search Problems''. Ph.D thesis, [[ETH Zurich]]</ref>. Awari was [[Solved Game|strongly solved]] by [[John Romein]] and [[Henri Bal]] in 2002 - either side can force a draw <ref>[[John Romein]], [[Henri Bal]] ('''2002'''). ''Awari is Solved''. [[ICGA Journal#25_3|ICGA Journal, Vol. 25, No. 3]]</ref>. 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]] [https://en.wikipedia.org/wiki/Java_applet 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 [https://en.wikipedia.org/wiki/Computer_cluster cluster] of 72 dual [[x86|PIII]] @ 1 GHz with 1 GiB of [[Memory|main memory]] each, connected through [https://en.wikipedia.org/wiki/Myrinet Myrinet], which took 51 hours <ref>[http://mancala.wikia.com/wiki/Awari_Oracle Awari Oracle - Mancala World - Wikia]</ref>.
=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 [[Repetitions|repeated position]] leads to an even division of the remaining stones, ending the game <ref>[[John Romein]], [[Henri Bal]] ('''2002'''). ''[http://ticc.uvt.nl/icga/journal/contents/content25-3.htm#AWARI%20IS%20SOLVED Awari is Solved]''. [[ICGA Journal#25_3|ICGA Journal, Vol. 25, No. 3]]</ref>. The rules slightly differ from one country to another. For example, the "[https://en.wikipedia.org/wiki/Awari#.22Grand_Slam.22_variations 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 <ref>[http://mancala.wikia.com/wiki/Awari_Oracle Awari Oracle - Mancala World - Wikia]</ref> were defined by [[Victor Allis]], [[Maarten van der Meulen]], and [[Jaap van den Herik]] in 1991 <ref>[[Victor Allis]], [[Maarten van der Meulen]], [[Jaap van den Herik]] ('''1991'''). ''Databases in Awari''. [[2nd Computer Olympiad|Heuristic Programming in Artificial Intelligence 2]]</ref>
=[[Computer Olympiad|Computer Olympiads]]=
* [[1st Computer Olympiad#Awari|1st Computer Olympiad, London 1989]]
* [[2nd Computer Olympiad#Awari|2nd Computer Olympiad, London 1990]]
* [[3rd Computer Olympiad#Awari|3rd Computer Olympiad, Maastricht 1991]]
* [[4th Computer Olympiad#Awari|4th Computer Olympiad, London 1992]]
* [[5th Computer Olympiad#Awari|5th Computer Olympiad, London 2000]]
=See also=
* [[Bao]]
* [[Kalah]]
=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, [[Maastricht University|University of Limburg]]
* [[Victor Allis]], [[Maarten van der Meulen]], [[Jaap van den Herik]] ('''1990'''). ''Databases in Awari''. Technical Report CS-90-5, [[Maastricht University|University of Limburg]]
* [[Victor Allis]], [[Maarten van der Meulen]], [[Jaap van den Herik]] ('''1991'''). ''Omniscience in Lithidion''. [[2nd Computer Olympiad#Workshop|Heuristic Programming in Artificial Intelligence 2]]
* [[Victor Allis]], [[Maarten van der Meulen]], [[Jaap van den Herik]] ('''1991'''). ''Databases in Awari''. [[2nd Computer Olympiad#Workshop|Heuristic Programming in Artificial Intelligence 2]]
==2000 ...==
* [[Jack van Rijswijck]] ('''2000'''). ''[http://link.springer.com/chapter/10.1007/3-540-45579-5_8 Learning from Perfection: A Data Mining Approach to Evaluation Function Learning in Awari]''. [[CG 2000]], [http://sites.google.com/site/javhar1/LearningFromPerfection.pdf pdf]
* [[Roel van der Goot]] ('''2000'''). ''[http://link.springer.com/chapter/10.1007/3-540-45579-5_6 Awari Retrograde Analysis]''. [[CG 2000]]
* [[Thomas Lincke]], [[Roel van der Goot]] ('''2000'''). ''Marvin Wins Awari Tournament''. [[ICGA Journal#23_3|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]], [http://e-collection.library.ethz.ch/eserv/eth:25905/eth-25905-02.pdf pdf] » [[Repetitions]] <ref>[http://www.open-chess.org/viewtopic.php?f=5&t=2093#p17469 Re: Aquarium IDEA, repetitions, and minimax over cycles] by [[Ronald de Man|syzygy]], [[Computer Chess Forums|OpenChess Forum]], September 22, 2012</ref>
* [[John Romein]], [[Henri Bal]] ('''2002'''). ''[http://ticc.uvt.nl/icga/journal/contents/content25-3.htm#AWARI%20IS%20SOLVED Awari is Solved]''. [[ICGA Journal#25_3|ICGA Journal, Vol. 25, No. 3]]
* [[Jeroen Donkers]] ('''2002'''). ''[http://ticc.uvt.nl/icga/journal/contents/content25-3.htm#COMMENTS%20ON%20THE%20AWARI%20SOLUTION Comments on the Awari Solution]''. [[ICGA Journal#25_3|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=
* [https://groups.google.com/d/msg/rec.games.chess/xAt5XlwwfAo/AMFWFZMYqYAJ Awari?] by [[Darse Billings]], [[Computer Chess Forums|rgc]], August 21, 1992
* [https://groups.google.com/d/msg/rec.games.chess/jiWscU23jZQ/ype2R9nZjNYJ awari macala] by [[Eric van Riet Paap]], [[Computer Chess Forums|rgc]], December 05, 1994
=External Links=
* [https://www.game-ai-forum.org/icga-tournaments/game.php?id=16 Awari (ICGA Tournaments)]
* [http://mancala.wikia.com/wiki/Awari_Oracle Awari Oracle - Mancala World - Wikia]
* [http://mancala.wikia.com/wiki/Oware Oware - Mancala World - Wikia]
* [https://en.wikipedia.org/wiki/Oware Oware from Wikipedia]
* [https://en.wikipedia.org/wiki/Ayoayo Ayoayo from Wikipedia]
* [http://www.oware.org/history.asp Oware - Played all over the world]
* [http://www.ist.tugraz.at/staff/aichholzer/games/awari.html Awari] by [[Oswin Aichholzer]] (German)
* [[Videos#Toto|Toto]] - [https://en.wikipedia.org/wiki/Africa_(Toto_song) Africa] ([https://en.wikipedia.org/wiki/Falling_in_Between_Live Falling in Between Live]), March 26, 2007, [https://en.wikipedia.org/wiki/Le_Z%C3%A9nith_(Paris,_France) Le Zénith, Paris], [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: lineup: [https://en.wikipedia.org/wiki/Steve_Lukather Steve Lukather], [https://en.wikipedia.org/wiki/Bobby_Kimball Bobby Kimball], [https://en.wikipedia.org/wiki/Greg_Phillinganes Greg Phillinganes], [[Videos#SimonPhillips|Simon Phillips]], [https://en.wikipedia.org/wiki/Leland_Sklar Leland Sklar], [https://en.wikipedia.org/wiki/Tony_Spinner Tony Spinner]
: {{#evu:https://www.youtube.com/watch?v=aymnC9PR7AQ|alignment=left|valignment=top}}
=References=
<references />
'''[[Games|Up one Level]]'''
