Game of the Amazons

Last updated
The Game of the Amazons
abcdefghij
10 Chess l45.svg Chess d45.svg Chess l45.svg Chess qdd45.svg Chess l45.svg Chess d45.svg Chess qdl45.svg Chess d45.svg Chess l45.svg Chess d45.svg 10
9 Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg 9
8 Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg 8
7 Chess qdd45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess qdl45.svg 7
6 Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg 6
5 Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg 5
4 Chess qll45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess qld45.svg 4
3 Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg 3
2 Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg 2
1 Chess d45.svg Chess l45.svg Chess d45.svg Chess qll45.svg Chess d45.svg Chess l45.svg Chess qld45.svg Chess l45.svg Chess d45.svg Chess l45.svg 1
abcdefghij
The starting position in The Game of the Amazons
Players2
Setup time20 seconds
Playing time30-60 minutes
ChanceNone
Age range4+
SkillsTactics, strategy, position

The Game of the Amazons (in Spanish, El Juego de las Amazonas; often called Amazons for short) is a two-player abstract strategy game invented in 1988 by Walter Zamkauskas of Argentina. [1] The game is played by moving pieces and blocking the opponents from squares, and the last player able to move is the winner. It is a member of the territorial game family, a distant relative of Go and chess.

Contents

The Game of the Amazons is played on a 10x10 chessboard (or an international checkerboard). Some players prefer to use a monochromatic board. The two players are White and Black; each player has four amazons (not to be confused with the amazon fairy chess piece), which start on the board in the configuration shown at right. A supply of markers (checkers, poker chips, etc.) is also required.

Rules

White moves first, and the players alternate moves thereafter. Each move consists of two parts. First, one moves one of one's own amazons one or more empty squares in a straight line (orthogonally or diagonally), exactly as a queen moves in chess; it may not cross or enter a square occupied by an amazon of either color or an arrow. Second, after moving, the amazon shoots an arrow from its landing square to another square, using another queenlike move. This arrow may travel in any orthogonal or diagonal direction (even backwards along the same path the amazon just traveled, into or across the starting square if desired). An arrow, like an amazon, cannot cross or enter a square where another arrow has landed or an amazon of either color stands. The square where the arrow lands is marked to show that it can no longer be used. The last player to be able to make a move wins. Draws are impossible.

abcdefghij
10 Chess l45.svg Chess d45.svg Chess l45.svg Chess qdd45.svg Chess l45.svg Chess d45.svg Chess qdl45.svg Chess d45.svg Chess l45.svg Chess d45.svg 10
9 Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess xod45.svg Chess l45.svg Chess d45.svg Chess l45.svg 9
8 Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg 8
7 Chess qdd45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess qdl45.svg 7
6 Chess l45.svg Chess d45.svg Chess l45.svg Chess qld45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg 6
5 Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg 5
4 Chess qll45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess qld45.svg 4
3 Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg 3
2 Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg 2
1 Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess d45.svg Chess l45.svg Chess qld45.svg Chess l45.svg Chess d45.svg Chess l45.svg 1
abcdefghij
The diagram shows a possible first move by white: d1-d6/g9, i.e. amazon moved from d1 to d6 and fired arrow to g9.

Territory and scoring

abcdefghij
10 Chess xol45.svg Chess d45.svg Chess l45.svg Chess qdd45.svg Chess xol45.svg Chess d45.svg Chess l45.svg Chess xod45.svg Chess l45.svg Chess d45.svg 10
9 Chess d45.svg Chess xol45.svg Chess xod45.svg Chess xol45.svg Chess d45.svg Chess xol45.svg Chess d45.svg Chess l45.svg Chess xod45.svg Chess l45.svg 9
8 Chess xol45.svg Chess xod45.svg Chess qll45.svg Chess xod45.svg Chess xol45.svg Chess xod45.svg Chess xol45.svg Chess xod45.svg Chess xol45.svg Chess xod45.svg 8
7 Chess d45.svg Chess l45.svg Chess xod45.svg Chess xol45.svg Chess xod45.svg Chess qll45.svg Chess d45.svg Chess l45.svg Chess xod45.svg Chess qll45.svg 7
6 Chess l45.svg Chess d45.svg Chess xol45.svg Chess d45.svg Chess xol45.svg Chess xod45.svg Chess xol45.svg Chess xod45.svg Chess xol45.svg Chess xod45.svg 6
5 Chess d45.svg Chess xol45.svg Chess xod45.svg Chess xol45.svg Chess qdd45.svg Chess xol45.svg Chess d45.svg Chess xol45.svg Chess d45.svg Chess l45.svg 5
4 Chess l45.svg Chess xod45.svg Chess xol45.svg Chess d45.svg Chess l45.svg Chess xod45.svg Chess xol45.svg Chess d45.svg Chess l45.svg Chess d45.svg 4
3 Chess xod45.svg Chess xol45.svg Chess d45.svg Chess xol45.svg Chess xod45.svg Chess xol45.svg Chess xod45.svg Chess xol45.svg Chess d45.svg Chess l45.svg 3
2 Chess xol45.svg Chess xod45.svg Chess l45.svg Chess xod45.svg Chess qll45.svg Chess xod45.svg Chess xol45.svg Chess d45.svg Chess l45.svg Chess d45.svg 2
1 Chess d45.svg Chess l45.svg Chess xod45.svg Chess qdl45.svg Chess xod45.svg Chess xol45.svg Chess qdd45.svg Chess l45.svg Chess d45.svg Chess xol45.svg 1
abcdefghij
A completed Amazons game. White has just moved f1-e2/f1. White now has 8 moves left, while Black has 31.

The strategy of the game is based on using arrows (as well as one's four amazons) to block the movement of the opponent's amazons and gradually wall off territory, trying to trap the opponents in smaller regions and gain larger areas for oneself. Each move reduces the available playing area, and eventually each amazon finds itself in a territory blocked off from all other amazons. The amazon can then move about its territory firing arrows until it no longer has any room to move. Since it would be tedious to actually play out all these moves, in practice the game usually ends when all of the amazons are in separate territories. The player with the largest amount of territory will be able to win, as the opponent will have to fill in their own territory more quickly.

Scores are sometimes used for tie-breaking purposes in Amazons tournaments. When scoring, it is important to note that although the number of moves remaining to a player is usually equal to the number of empty squares in the territories occupied by that player's amazons, it is nonetheless possible to have defective territories in which there are fewer moves left than there are empty squares. The simplest such territory is three squares of the same colour, not in a straight line, with the amazon in the middle (for example, a1+b2+c1 with the amazon at b2).

History

El Juego de las Amazonas was first published in Spanish in the Argentine puzzle magazine El Acertijo in December 1992. An approved English translation written by Michael Keller appeared in the magazine World Game Review in January 1994. [1] Other game publications also published the rules, and the game gathered a small but devoted following. The Internet spread the game more widely.

Michael Keller wrote the first known computer version of the game in VAX Fortran in 1994, [2] and an updated version with graphics in Visual Basic in 1995. [1] [2] There are Amazons tournaments at the Computer Olympiad, a series of computer-versus-computer competitions.

El Juego de las Amazonas (The Game of the Amazons) is a trademark of Ediciones de Mente.

Computational complexity

Usually, in the endgame, the board is partitioned into separate "royal chambers", with queens inside each chamber. We define simple Amazons endgames to be endgames where each chamber has at most one queen. Determining who wins in a simple Amazons endgame is NP-hard. [3] This is proven by reducing it to finding the Hamiltonian path of a cubic subgraph of the square grid graph.

Generalized Amazons (that is, determining the winner of a game of Amazons played on a n x n grid, started from an arbitrary configuration) is PSPACE-complete. [4] [5] This can be proved in two ways.

Related Research Articles

<span class="mw-page-title-main">Chess</span> Strategy board game

Chess is a board game for two players. It is sometimes called international chess or Western chess to distinguish it from related games such as xiangqi and shogi.

<span class="mw-page-title-main">Phutball</span> Two-person board game

Phutball is a two-player abstract strategy board game described in Elwyn Berlekamp, John Horton Conway, and Richard K. Guy's Winning Ways for your Mathematical Plays.

<span class="mw-page-title-main">Hex (board game)</span> Abstract strategy board game

Hex is a two player abstract strategy board game in which players attempt to connect opposite sides of a rhombus-shaped board made of hexagonal cells. Hex was invented by mathematician and poet Piet Hein in 1942 and later rediscovered and popularized by John Nash.

Chess strategy is the aspect of chess play concerned with evaluation of chess positions and setting goals and long-term plans for future play. While evaluating a position strategically, a player must take into account such factors as the relative value of the pieces on the board, pawn structure, king safety, position of pieces, and control of key squares and groups of squares. Chess strategy is distinguished from chess tactics, which is the aspect of play concerned with the move-by-move setting up of threats and defenses. Some authors distinguish static strategic imbalances, which tend to persist for many moves, from dynamic imbalances, which are temporary. This distinction affects the immediacy with which a sought-after plan should take effect. Until players reach the skill level of "master", chess tactics tend to ultimately decide the outcomes of games more often than strategy. Many chess coaches thus emphasize the study of tactics as the most efficient way to improve one's results in serious chess play.

<span class="mw-page-title-main">Queen (chess)</span> Chess piece

The queen is the most powerful piece in the game of chess. It can move any number of squares vertically, horizontally or diagonally, combining the powers of the rook and bishop. Each player starts the game with one queen, placed in the middle of the first rank next to the king. Because the queen is the strongest piece, a pawn is promoted to a queen in the vast majority of cases.

In computational complexity theory, a decision problem is PSPACE-complete if it can be solved using an amount of memory that is polynomial in the input length and if every other problem that can be solved in polynomial space can be transformed to it in polynomial time. The problems that are PSPACE-complete can be thought of as the hardest problems in PSPACE, the class of decision problems solvable in polynomial space, because a solution to any one such problem could easily be used to solve any other problem in PSPACE.

<span class="mw-page-title-main">Checkers</span> Strategy board game

Checkers, also known as draughts, is a group of strategy board games for two players which involve forward movements of uniform game pieces and mandatory captures by jumping over opponent pieces. Checkers is developed from alquerque. The term "checkers" derives from the checkered board which the game is played on, whereas "draughts" derives from the verb "to draw" or "to move".

A solved game is a game whose outcome can be correctly predicted from any position, assuming that both players play perfectly. This concept is usually applied to abstract strategy games, and especially to games with full information and no element of chance; solving such a game may use combinatorial game theory and/or computer assistance.

The endgame is the final stage of a chess game which occurs after the middlegame. It begins when few pieces are left on the board.

This glossary of chess explains commonly used terms in chess, in alphabetical order. Some of these terms have their own pages, like fork and pin. For a list of unorthodox chess pieces, see Fairy chess piece; for a list of terms specific to chess problems, see Glossary of chess problems; for a list of named opening lines, see List of chess openings; for a list of chess-related games, see List of chess variants; for a list of terms general to board games, see Glossary of board games.

<span class="mw-page-title-main">Havannah (board game)</span>

Havannah is a two-player abstract strategy board game invented by Christian Freeling. It belongs to the family of games commonly called connection games; its relatives include Hex and TwixT. Havannah has "a sophisticated and varied strategy" and is best played on a base-10 hexagonal board, 10 hex cells to a side.

Combinatorial game theory measures game complexity in several ways:

  1. State-space complexity,
  2. Game tree size,
  3. Decision complexity,
  4. Game-tree complexity,
  5. Computational complexity.
<span class="mw-page-title-main">Generalized game</span> Game generalized so that it can be played on a board or grid of any size

In computational complexity theory, a generalized game is a game or puzzle that has been generalized so that it can be played on a board or grid of any size. For example, generalized chess is the game of chess played on an board, with pieces on each side. Generalized Sudoku includes Sudokus constructed on an grid.

In computational complexity theory, generalized geography is a well-known PSPACE-complete problem.

<span class="mw-page-title-main">Go and mathematics</span> Calculations of the game complexity of go

The game of Go is one of the most popular games in the world. As a result of its elegant and simple rules, the game has long been an inspiration for mathematical research. Shen Kuo, an 11th century Chinese scholar, estimated in his Dream Pool Essays that the number of possible board positions is around 10172. In more recent years, research of the game by John H. Conway led to the development of the surreal numbers and contributed to development of combinatorial game theory (with Go Infinitesimals being a specific example of its use in Go).

<span class="mw-page-title-main">Kōnane</span> Two-player strategy board game from Hawaii

Kōnane is a two-player strategy board game from Hawaii which was invented by the ancient Hawaiian Polynesians. The game is played on a rectangular board and begins with black and white counters filling the board in an alternating pattern. Players then hop over one another's pieces, capturing them similar to checkers. The first player unable to capture is the loser.

<span class="mw-page-title-main">Outline of chess</span> Strategy board game

The following outline is provided as an overview of and topical guide to chess:

<span class="mw-page-title-main">Three-man chess</span> Chess variant intended for three players and played on a hexagonal board

Three-man chess is a chess variant for three players invented by George R. Dekle Sr. in 1984. The game is played on a hexagonal board comprising 96 quadrilateral cells. Each player controls a standard army of chess pieces.

<i>5D Chess with Multiverse Time Travel</i> 2020 chess variant video game

5D Chess with Multiverse Time Travel is a 2020 chess variant video game released for Microsoft Windows, macOS, and Linux by American studio Thunkspace. Its titular mechanic, multiverse time travel, allows pieces to travel through time and between timelines in a similar way to how they move through ranks and files.

References

  1. 1 2 3 Pegg, Ed (1999), Amazons , retrieved 2014-10-19.
  2. 1 2 Keller, Michael, El Juego de las Amazonas (The Game of the Amazons) , retrieved 2014-10-26.
  3. Buro, Michael (2000), "Simple Amazons endgames and their connection to Hamilton circuits in cubic subgrid graphs" (PDF), Conference on Computers and Games, pp. 250–261, doi:10.1007/3-540-45579-5_17 .
  4. Furtak, Timothy; Kiyomi, Masashi; Uno, Takeaki; Buro, Michael (2005), "Generalized Amazons is PSPACE-complete" (PDF), IJCAI.
  5. Hearn, Robert A. (February 2, 2005), Amazons is PSPACE-complete, arXiv: cs.CC/0502013 .
  6. Stefan Reisch (1981). "Hex ist PSPACE-vollständig (Hex is PSPACE-complete)". Acta Informatica (15): 167–191. doi:10.1007/bf00288964. S2CID   9125259.

Further reading