Arimaa

Arimaa

An Arimaa elephant
Designer(s) Omar Syed and Aamir Syed
Publisher(s) Z-Man Games
Years active 2002 – present
Genre(s) Board game
Abstract strategy game
Players 2
Setup time < 1 minute
Playing time 15 minutes – 2 hours
Random chance None
Skill(s) required Strategy, tactics
Website http://www.arimaa.com

Arimaa i/əˈriːmə/ (ə-REE-mə) is a two-player strategy board game that was designed to be playable with a standard chess set and difficult for computers while still being easy to learn and fun to play for humans. Every year since 2004, the Arimaa community has held three tournaments: a World Championship (humans only), a Computer Championship (computers only), and the Arimaa Challenge (human vs. computer). In 2015, the challenge was won decisively by the computer (Sharp by David Wu), with top players agreeing that computers had become better at the game than humans.[1] As it was a prerequisite for the prize to be awarded, most of ICGA Journal Issue 38/1 was dedicated to this topic.[2]

Arimaa was invented in 2003 by Omar Syed,[3] an Indian American computer engineer trained in artificial intelligence. Syed was inspired by Garry Kasparov's defeat at the hands of the chess computer Deep Blue to design a new game which could be played with a standard chess set, would be difficult for computers to play well, but would have rules simple enough for his then four-year-old son Aamir to understand.[4] ("Arimaa" is "Aamir" spelled backwards plus an initial "a".)

Arimaa has won several awards including GAMES Magazine 2011 Best Abstract Strategy Game,[5] Creative Child Magazine 2010 Strategy Game of the Year,[6] and the 2010 Parents' Choice Approved Award.[7] It has also been the subject of several research papers.

Rules

Arimaa is played on an 8×8 board with four trap squares. There are six kinds of pieces, ranging from elephant (strongest) to rabbit (weakest). Stronger pieces can push or pull weaker pieces, and stronger pieces freeze weaker pieces. Pieces can be captured by dislodging them onto a trap square when they have no orthogonally adjacent friendly pieces. There are three ways to win the game:

  1. Move a rabbit to the eighth row (for the gold player) or first row (for the silver player) of the board.
  2. Capture all enemy rabbits.
  3. Deprive the opponent of legal moves.

The two players, Gold and Silver, each control sixteen pieces. These are, in order from strongest to weakest: one elephant (), one camel (), two horses (), two dogs (), two cats (), and eight rabbits (). These may be represented by the king, queen, rooks, bishops, knights, and pawns respectively when one plays using a chess set.[8]
Diagram 1
The players begin by setting up their pieces however they choose on their home rows.

Goal

The object of the game is to move a rabbit of one's own color onto the home rank of the opponent. Thus Gold wins by moving a gold rabbit to the eighth rank, and Silver wins by moving a silver rabbit to the first rank. However, because it is difficult to usher a rabbit to the goal line while the board is full of pieces, an intermediate objective is to capture opposing pieces by pushing or pulling them into the trap squares.

Setup

The game begins with an empty board. Gold places the sixteen gold pieces in any configuration on the first and second ranks. Silver then places the sixteen silver pieces in any configuration on the seventh and eighth ranks. Diagram 1 shows one possible initial placement.
Diagram 2
In the diagrammed position, if it were Gold's turn to move, Gold could win in two steps: The dog on a6 can push the rabbit on a7 to a8, thereby unfreezing the rabbit on b7, which can step to b8 for the victory.

Movement

After the pieces are placed on the board, the players alternate turns, starting with Gold. A turn consists of making one to four steps. With each step a piece may move into an unoccupied square one space left, right, forward, or backward, except that rabbits may not step backward. The steps of a turn may be made by a single piece or distributed between several pieces in any order.

A turn must make a net change to the position. Thus one cannot, for example, take one step forward and one step back with the same piece, effectively passing the turn and evading zugzwang. Furthermore, one's turn may not create the same position with the same player to move as has been created twice before. This rule is similar to the situational super ko rule in the game of Go, which prevents endless loops, and is in contrast to chess where endless loops are considered draws. The prohibitions on passing and repetition make Arimaa a drawless game.

Pushing and pulling

The second diagram, from the same game as the initial position above, helps illustrate the remaining rules of movement.

A player may use two consecutive steps of a turn to dislodge an opposing piece with a stronger friendly piece which is adjacent in one of the four cardinal directions. For example, a player's dog may dislodge an opposing rabbit or cat, but not a dog, horse, camel, or elephant. The stronger piece may pull or push the adjacent weaker piece. When pulling, the stronger piece steps into an empty square, and the square it came from is occupied by the weaker piece. The silver elephant on d5 could step to d4 (or c5 or e5) and pull the gold horse from d6 to d5. When pushing, the weaker piece is moved to an adjacent empty square, and the square it came from is occupied by the stronger piece. The gold elephant on d3 could push the silver rabbit on d2 to e2 and then occupy d2. Note that the rabbit on d2 can't be pushed to d1, c2, or d3, because those squares are not empty.

Friendly pieces may not be dislodged. Also, a piece may not push and pull simultaneously. For example, the gold elephant on d3 could not simultaneously push the silver rabbit on d2 to e2 and pull the silver rabbit from c3 to d3. An elephant can never be dislodged, since there is nothing stronger.

Freezing

A piece which is adjacent in any cardinal direction to a stronger opposing piece is frozen, unless it is also adjacent to a friendly piece. Frozen pieces may not be moved by the owner, but may be dislodged by the opponent. A frozen piece can freeze another still weaker piece. The silver rabbit on a7 is frozen, but the one on d2 is able to move because it is adjacent to a silver piece. Similarly the gold rabbit on b7 is frozen, but the gold cat on c1 is not. The dogs on a6 and b6 do not freeze each other because they are of equal strength. An elephant cannot be frozen, since there is nothing stronger, but an elephant can be blockaded.

Capturing

A piece which enters a trap square is captured and removed from the game unless there is a friendly piece orthogonally adjacent. Silver could move to capture the gold horse on d6 by pushing it to c6 with the elephant on d5. A piece on a trap square is captured when all adjacent friendly pieces move away. Thus if the silver rabbit on c4 and the silver horse on c2 move away, voluntarily or by being dislodged, the silver rabbit on c3 will be captured.

Note that a piece may voluntarily step into a trap square, even if it is thereby captured. Also, the second step of a pulling maneuver is completed even if the piece doing the pulling is captured on the first step. For example, Silver could step the silver rabbit from f4 to g4 (so that it will no longer support pieces at f3), and then step the silver horse from f2 to f3, which captures the horse; the horse's move could still pull the gold rabbit from f1 to f2.

Ways to lose

A player who loses every rabbit loses the game (by elimination). A player who cannot make a move at all also loses the game (by immobilization).

Strategy and tactics

For beginning insights into good play, see the Arimaa Wikibook articles on tactics and strategy.

Karl Juhnke, twice Arimaa world champion,[9] has written a book titled Beginning Arimaa which gives an introduction to Arimaa tactics and strategies. Also Jean Daligault, six time Arimaa world champion,[9] wrote Arimaa Strategies and Tactics which is geared towards those who have started playing Arimaa and want to improve their game.

Annual tournaments

World Championship

Each year since 2004 the Arimaa community has held a World Championship tournament.[9] The tournament is played over the Internet and is open to everyone. The current world champion is Mathew Brown of the United States of America.[9] Past world champion title holders are:[9]

World Computer Championship

Each year since 2004 the Arimaa community has held a World Computer Championship tournament.[9] The tournament is played over the Internet and is open to everyone. The current champion is bot_sharp developed by David Wu of the USA.[9] Past computer world champion title holders are:[9]

Arimaa Challenge

The Arimaa Challenge was a cash prize of around $10,000 that was available annually until 2020 for the first computer program to win the human-versus-computer Arimaa challenge.[10] As part of the conditions of the prize, the computer program must run on standard, off-the-shelf hardware.[10]

The Arimaa Challenge has been held twelve times, starting in 2004. Prior to the third match, Syed changed the format to require the software to win two out of three games against each of three players, to reduce the psychological pressure on individual volunteer defenders. Also Syed called for outside sponsorship of the Arimaa Challenge to build a bigger prize fund.

Year Prize[lower-alpha 1] Challenger / Developer Human Defender (Human Rank)[11][lower-alpha 2] Result Notes
2004 $10,000 Bomb /
David Fotland		 Omar Syed (1) 0–8 Syed gave a rabbit handicap in the last game and won.
2005 $10,000 Bomb /
David Fotland		 Frank Heinemann (5) 1–7 No handicap games
2006 $17,500 Bomb /
David Fotland		 Karl Juhnke (1)
Greg Magne (2)
Paul Mertens (5)		 0–3
0–3
1–2		 Mertens gave a camel handicap in his last game and lost.
2007 $17,100 Bomb /
David Fotland		 Karl Juhnke (1)
Omar Syed (9)
Brendan M (12)
N Siddiqui (23)		 0–3
0–3
0–2
1–0		 Juhnke gave handicaps of a dog, a horse, and a camel respectively, and won all three. Syed gave a cat handicap in his last game and won. Siddiqui substituted for Brendan's third game.
2008 $17,000 Bomb /
David Fotland		 Jean Daligault (2)
Greg Magne (3)
Mark Mistretta (20)
Omar Syed (24)		 0–3
0–3
0–1
0–2		 No handicap games. Syed substituted for Mistretta's final two games.
2009 $16,500 Clueless /
Jeff Bacher		 Jean Daligault (1)
Karl Juhnke (2)
Jan Macura (14)
Omar Syed (18)		 0–2
1–2
1–2
0–1		 Juhnke gave a dog handicap in his second game and lost. Daligault gave a horse handicap in his last game and won. Syed substituted for Daligault's first game.
2010 $16,250 Marwin /
Mattias Hultgren		 Greg Magne (3)
Louis-Daniel Scott (10)
Patrick Dudek (23)		 0–3
1–2
2–1		 Scott gave a dog handicap in his second game and lost.
2011 $11,000 Marwin /
Mattias Hultgren		 Karl Juhnke (3)
Gregory Clark (7)
Toby Hudson (14)		 1–2
0–3
0–3		 Juhnke gave a cat handicap in his last game and lost.
2012 $11,150 Briareus /
Ricardo Barreira		 Jean Daligault (1)
Hirohumi Takahashi (2)
Eric Momsen (5)		 0-3
0-3
3-0		 Takahashi gave a cat handicap in his last game and won.
2013 $11,000 Marwin /
Mattias Hultgren		 Mathew Brown (4)
Greg Magne (6)
Matthew Craven (31)		 0-3
0-3
1-2		 Magne gave a cat handicap in his last game and won. Brown gave a horse handicap in his last game and won.
2014 $12,000 Ziltoid /
Ricardo Barreira		 Karl Juhnke (3)
Samuel Schüler (12)
Max Manual (73)[lower-alpha 3]		 0-3
1-2
1-2		 No handicap games.
2015 $12,000 Sharp /
David Wu		 Mathew Brown (1)
Jean Daligault (4)
Lev Ruchka (13)		 2-1
2-1
3-0		 David Wu wins the Arimaa Challenge.

In the first five challenge cycles, David Fotland, programmer of Many Faces of Go, won the Arimaa Computer Championship and the right to play for the prize money, only to see his program beaten decisively each year. In 2009 Fotland's program was surpassed by several new programs in the same year, the strongest of which was Clueless by Jeff Bacher. Humanity's margin of dominance over computers appeared to widen each year from 2004 to 2008 as the best human players improved, but the 2009 Arimaa Challenge was more competitive. Clueless became the first bot to win two games of a Challenge match.

In 2010, Mattias Hultgren's bot Marwin edged out Clueless in the computer championship. In the Challenge match Marwin became the first bot to win two out of three games against a single human defender, and also the first bot to win three of the nine games overall. In 2011, however, Marwin won only one of the nine games, and that one having received a material handicap. In 2012 a new challenger, Briareus, became the first program to defeat a top-ten player, sweeping all three games from the fifth-ranked human. In 2013, however, the humans struck back against Marwin, with #4 and #6 each sweeping including a handicap win, and #31 winning two of three games. In 2014, the computer bounced back to win two games, albeit no matches.

In 2015, Sharp made a substantial leap in playing strength. After having scored 6-6 in twelve games against its top two computer rivals the previous year, Sharp went undefeated in the computer tournaments of 2015, including 13-0 against the second- and third-place finishers. Sharp dominated the pre-Challenge screening against human opponents, winning 27 of 29 games. In the Challenge itself, Sharp clinched victory in each of the three mini-matches by winning the first six games, finishing 7-2 overall and winning the Arimaa challenge.[10]

The material handicaps given in the Challenge games can be roughly equated to chess handicaps as a proportion of the total material on the board in each game. Arimaa handicaps of rabbit, dog, horse, and camel are roughly equivalent to chess handicaps of pawn, two pawns, knight, and rook respectively.

Patent and trademark

US PAT No. 6,981,700 was filed on 3 October 2003, and granted on 3 January 2006. Omar Syed also holds a trademark on the name "Arimaa".

Syed has stated that he does not intend to restrict noncommercial use and has released a license called "The Arimaa Public License" with the declared intent to "make Arimaa as much of a public domain game as possible while still protecting its commercial usage". Items covered by the license are the patent and the trademark.

See also

Notes

  1. ↑ The history of prize fund pledges is as follows: In 2002 Omar Syed pledged $10,000 until 2020; Prior to 2006 Omar Syed pledged an additional $5,000 until 2010; Prior to 2006 Paul Mertens pledged $2,000 for 2006, $1,500 for 2007, $1,000 for 2008, $500 for 2009, and $250 for 2010; Prior to 2006 Karl Juhnke pledged $500 for 2006; Prior to 2007 Karl Juhnke pledged $600 for 2007; Prior to 2008 Karl Juhnke pledged $1,000 for 2008; Prior to 2009 Karl Juhnke pledged $1,000 for 2009; Prior to 2010 Karl Juhnke pledged $1,000 for 2010; Prior to 2011 Karl Juhnke pledged $1,000 for 2011
  2. ↑ The listed ranks include inactive players. Among active players only, the 2010 ranks were Magne(3), Scott(9), Dudek(16), the 2011 ranks were Juhnke(3), Clark(5), Hudson(10), the 2012 ranks were the same as listed, the 2013 ranks were Brown(3), Magne(5), Craven(17), the 2014 ranks were Juhnke(2), Schüler(10), and Manual(33), and the 2015 ranks were Daligault(3) and Ruchka(10).
  3. ↑ Manual was an anti-computer specialist with too few games against human opponents for accurate ranking.

References

  1. ↑ "Arimaa: Game Over?".
  2. ↑ "Arimaa: ChessProgramming Wiki".
  3. ↑ Syed, Omar; Syed, Aamir (2003). "Arimaa – a New Game Designed to be Difficult for Computers". International Computer Games Association Journal 26: 138–139.
  4. ↑ "Arimaa Forum - plz say more about the design decisions".
  5. ↑ "GAMES Game Awards".
  6. ↑ http://www.murphymonitor.com/articles/templates/news.asp?articleid=1436&zoneid=3
  7. ↑ "Arimaa". Parents' Choice Foundation.
  8. ↑ "Arimaa Game Rules".
  9. 1 2 3 4 5 6 7 8 "The Arimaa World Championship".
  10. 1 2 3 "The Arimaa Challenge".
  11. ↑ The Arimaa Forum The rank of human players was calculated from human games only, and does not necessarily reflect anti-computer expertise or lack thereof.

Further reading

External links

Wikimedia Commons has media related to Arimaa.
Wikibooks has a book on the topic of: Arimaa
This article is issued from Wikipedia - version of the Friday, April 08, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.