Concept

Arimaa

Arimaa ə'riː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. It was invented between 1997 and 2002 by Omar Syed, 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. ("Arimaa" is "Aamir" spelled backwards plus an initial "a".) Beginning in 2004, the Arimaa community held three annual tournaments: a World Championship (humans only), a Computer Championship (computers only), and the Arimaa Challenge (human vs. computer). After eleven years of human dominance, the 2015 challenge was won decisively by the computer (Sharp by David Wu). Arimaa has won several awards including GAMES Magazine 2011 Best Abstract Strategy Game, Creative Child Magazine 2010 Strategy Game of the Year, and the 2010 Parents' Choice Approved Award. It has also been the subject of several research papers. 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 pieces. 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. The main object of the game is to move a rabbit of one's own color onto the home rank of the opponent, which is known as a goal.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.