Ricochet Robots

Last updated
Ricochet Robots
Ricochet Robot 1.jpg
A game of Ricochet Robots in progress.
Designers Alex Randolph
Publishers Rio Grande Games
Players2 or more
Setup time< 5 minutes
Playing time15 to 45 minutes
ChanceNone
Age range9 and older
Skills
  • Problem solving
  • Route visualisation

Ricochet Robots is a puzzle board game for 2 or more people, designed by Alex Randolph, in which the playing pieces (robots) must be moved to selected locations in as few moves as possible, working within strict limitations on robots' movements. The game was first published in Germany in 1999 as Rasende Roboter. An English version was published by Rio Grande Games.

Contents

Gameplay

The board consists of four double-sided quarters, each with a hole in a corner; these corners meet in the middle of the board, where a plastic piece with four stubs holds them in place. Board quarters can be permuted and flipped over to give 96 different board arrangements. There are also 17 chips, 16 with a symbol on a colored background and one multicolored corresponding exactly to a field on the board. At the beginning of play, four colored robots (also matching the colored fields) are placed randomly on the board and one of the chips is turned over.

The object of the game is to bring the robot of the correct colour to the field indicated on the overturned chip using as few moves as possible. Any of the robots can be moved horizontally or vertically, and they do not stop until they reach an obstacle — either a wall or another robot. As soon as one of the players has found a solution, they state the total number of moves for all of the robots used and start a timer. Then every player has the chance to state the number of moves for their solution until the time runs out. After that, the player who stated the lowest number of moves shows their solution. If they correctly demonstrate a solution in the stated number of moves or less, they earn the chip. If not, the player with the next higher number may try, and so on; then a new chip is turned over and a new round begins. After all 17 chips have been used up, the player with the most chips wins the game.

Problem-solving implications

Because of Ricochet Robots' game structure and complex problem solving techniques, it has been the subject of academic study. The study, argues that Ricochet Robots is a good game to analyze problem solving techniques of humans and computers. [1] Although Ricochet Robots has an initially exponential increase in complexity, it is solvable by polynomial time algorithms. This is because the number of possible positions is greatly limited by the relatively low number of robots (four or five) and so an efficient algorithm may search through all possible positions.

Editions

Three editions were published by Rio Grande Games. The first edition was called Ricochet Robot (without the s). It was identical to the original Rasende Roboter. This edition was replaced by the 3rd edition.

The second edition, called Ricochet Robots (also known as the blue version, because of the blue box), contained one more robot (a black robot) and adds 45 degrees walls on the boards, which complicates the game. The boards of the 2nd and original/3rd editions are compatible and can be mixed up. This edition is out of print at the moment.

The third edition is still called Ricochet Robots, but is the same as the original except it adds an extra silver robot.

The latest edition from Z-Man Games, has eight two-sided boards that can be combined for over 1,500 board configurations. [2]

Variations

54 game variations (different rules) using the silver robot have been added by players. [3]

Related Research Articles

The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so that no two queens threaten each other; thus, a solution requires that no two queens share the same row, column, or diagonal. There are 92 solutions. The problem was first posed in the mid-19th century. In the modern era, it is often used as an example problem for various computer programming techniques.

<span class="mw-page-title-main">Pentomino</span> Geometric shape formed from five squares

Derived from the Greek word for '5', and "domino", a pentomino is a polyomino of order 5, that is, a polygon in the plane made of 5 equal-sized squares connected edge-to-edge. When rotations and reflections are not considered to be distinct shapes, there are 12 different free pentominoes. When reflections are considered distinct, there are 18 one-sided pentominoes. When rotations are also considered distinct, there are 63 fixed pentominoes.

<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.

<span class="mw-page-title-main">Peg solitaire</span> Board game for one player

Peg solitaire, Solo Noble or simply Solitaire is a board game for one player involving movement of pegs on a board with holes. Some sets use marbles in a board with indentations. The game is known as solitaire in Britain and as peg solitaire in the US where 'solitaire' is now the common name for patience. It is also called Brainvita in India, where sets are sold commercially under this name.

<span class="mw-page-title-main">Knight's tour</span> Mathematical problem set on a chessboard

A knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every square exactly once. If the knight ends on a square that is one knight's move from the beginning square, the tour is closed ; otherwise, it is open.

<span class="mw-page-title-main">Sokoban</span> 1981 video game

Sokoban is a puzzle video game in which the player pushes boxes around in a warehouse, trying to get them to storage locations. The game was designed in 1981 by Hiroyuki Imabayashi, and first published in December 1982.

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

Checkers, also known as draughts, is a group of strategy board games for two players which involve diagonal moves 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.

In computer science, brute-force search or exhaustive search, also known as generate and test, is a very general problem-solving technique and algorithmic paradigm that consists of systematically checking all possible candidates for whether or not each candidate satisfies the problem's statement.

<span class="mw-page-title-main">Chess problem</span> A chess composition whose solution is a mate or other clear objective

A chess problem, also called a chess composition, is a puzzle set by the composer using chess pieces on a chess board, which presents the solver with a particular task. For instance, a position may be given with the instruction that White is to move first, and checkmate Black in two moves against any possible defence. A chess problem fundamentally differs from over-the-board play in that the latter involves a struggle between Black and White, whereas the former involves a competition between the composer and the solver. Most positions which occur in a chess problem are 'unrealistic' in the sense that they are very unlikely to occur in over-the-board play. There is a good deal of specialized jargon used in connection with chess problems.

<i>Mastermind</i> (board game) Board game

Mastermind or Master Mind is a code-breaking game for two players invented in Israel. It resembles an earlier pencil and paper game called Bulls and Cows that may date back a century.

In the context of Combinatorial game theory, which typically studies sequential games with perfect information, a game tree is a graph representing all possible game states within such a game. Such games include well-known ones such as chess, checkers, Go, and tic-tac-toe. This can be used to measure the complexity of a game, as it represents all the possible ways a game can pan out. Due to the large game trees of complex games such as chess, algorithms that are designed to play this class of games will use partial game trees, which makes computation feasible on modern computers. Various methods exist to solve game trees. If a complete game tree can be generated, a deterministic algorithm, such as backward induction or retrograde analysis can be used. Randomized algorithms and minimax algorithms such as MCTS can be used in cases where a complete game tree is not feasible.

The Shannon switching game is a connection game for two players, invented by American mathematician and electrical engineer Claude Shannon, the "father of information theory" some time before 1951. Two players take turns coloring the edges of an arbitrary graph. One player has the goal of connecting two distinguished vertices by a path of edges of their color. The other player aims to prevent this by using their color instead. The game is commonly played on a rectangular grid; this special case of the game was independently invented by American mathematician David Gale in the late 1950s and is known as Gale or Bridg-It.

<span class="mw-page-title-main">Connect Four</span> Childrens board game

Connect Four is a game in which the players choose a color and then take turns dropping colored tokens into a six-row, seven-column vertically suspended grid. The pieces fall straight down, occupying the lowest available space within the column. The objective of the game is to be the first to form a horizontal, vertical, or diagonal line of four of one's own tokens. It is therefore a type of M,n,k-game with restricted piece placement. Connect Four is a solved game. The first player can always win by playing the right moves.

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.

God's algorithm is a notion originating in discussions of ways to solve the Rubik's Cube puzzle, but which can also be applied to other combinatorial puzzles and mathematical games. It refers to any algorithm which produces a solution having the fewest possible moves. The allusion to the deity is based on the notion that an omniscient being would know an optimal step from any given configuration.

<span class="mw-page-title-main">Zillions of Games</span> General game playing software

Zillions of Games is a commercial general game playing system developed by Jeff Mallett and Mark Lefler in 1998. The game rules are specified with S-expressions, Zillions rule language. It was designed to handle mostly abstract strategy board games or puzzles. After parsing the rules of the game, the system's artificial intelligence can automatically play one or more players. It treats puzzles as solitaire games and its AI can be used to solve them.

<i>Mutant Meeples</i>

Mutant Meeples is a 2012 board game designed by Ted Alspach and published by Beziér Games and Pegasus Spiele. The game has been inspired by Ricochet Robots by Alex Randolph.

<span class="mw-page-title-main">Ultimate tic-tac-toe</span> Variant of tic-tac-toe game

Ultimate tic-tac-toe is a board game composed of nine tic-tac-toe boards arranged in a 3 × 3 grid. Players take turns playing on the smaller tic-tac-toe boards until one of them wins on the larger board. Compared to traditional tic-tac-toe, strategy in this game is conceptually more difficult and has proven more challenging for computers.

References

  1. Butko, Nicolas; Lehmann, Katharina A.; Ramenzoni, Veronica (September 15, 2005). "Ricochet Robots - A Case Study for Human Complex Problem Solving" (PDF).
  2. "Upgrade Complete".
  3. "Translation of Silver Robot variants from Hans im Gluck website". www.boardgamegeek.com. Retrieved 2017-05-02.