Awari Solved

Posted by michael on Friday September 6, 2002 @10:35AM from the chess,-go-and-twister-still-not-solved dept.

Gerard Jendras sent in a submission about applying computing power to an ancient game. The game of Awari has been solved: with perfect play, the game always results in a draw. There is a Java applet to test your skills against.

Min score:

Reason:

Sort:

Re:Freecell Solitaire... by extra+the+woos · 2002-09-06 10:46 · Score: 5, Interesting

Nope, it's not true... If you have windows freecell, go into it and put in select game. Type in "-1" or "-2" and see for yourself :)

--
replacing it with NEW Folger's Crystals! (lets see if they notice the difference)
3500 year old technology by cr@ckwhore · 2002-09-06 11:02 · Score: 3, Interesting

The game is estimated to be 3500+ years old. I'm really astounded by the fact that a perfect game is a draw! 3500 years ago, they created a piece of mathematical perfection... with rocks.

--
Skiers and Riders -- http://www.snowjournal.com
Re:Important Step? by bwt · 2002-09-06 12:51 · Score: 3, Interesting

I don't quite understand why a big lookup table is an important step for AI.

What AI wants is code that plays, observes the results, and converges to perfect play. One such algorithm has been produced and perfect play has been determined. Now the question is can an algorithm that converges *faster* be found. Learning speed can now be objectively measured, which opens a whole new scientific basis for studying AI.
Re:a perfect game by Old+Wolf · 2002-09-06 16:49 · Score: 3, Interesting

Not so; in some games the second player wins, here's an example:

you have a pile of 21 matches. players alternate turns. on your turn you may take either 1, 2, or 3 matches. whoever takes the last match LOSES.