Sports, games, and recreation / Board, card, and puzzle games / Board games / Modern designer board games / Modern abstract and tile-laying games / Amazons and isolation games

General · Edgepedia5 min read

Isolation

Isolation is a two-player abstract strategy board game in which each player moves a single pawn one square per turn and then permanently removes one tile from the board, trying to leave the opponent's pawn with no legal move. The name comes from the German Insel (island) or "isolate": the loser ends up stranded on a shrinking board.1

Key factDetail
Equipment6×8 grid, 46 removable square tiles, 2 pawns2
Play time and ageAbout 20 minutes; recommended from age 83
BoardGameGeek standingRating 5.80/10 from 259 ratings, rank #17509, complexity 1.61/53

Gameplay

The board is a 6×8 grid of removable squares. The Lakeside edition used a plastic board with 46 yellow plastic tiles that press down and fall out of the grid, making each removal visible as a hole.2

On a turn a player moves the pawn one square in any direction, orthogonally or diagonally, onto a tile that is still present and not occupied by the other pawn, then removes any one free tile anywhere on the board. Removed tiles are gone for the rest of the game and neither pawn may enter them. The first player whose pawn has no legal move at the start of their turn loses, so the game cannot end in a draw.4Because every turn destroys a square, the playable area shrinks steadily and mobility falls on both sides. Practical advice from a computer-implemented version captures the standard ideas: early on, room matters more than position, so players step to tiles with many free neighbors and stay off the edges; removing tiles next to the opponent's pawn costs that pawn an exit; and a row of removed tiles that splits the board should be completed only when your side holds the larger region, since when the pawns can no longer reach each other the player with the bigger region outlasts the other.4

Publication history

Kienitz designed the game as Isola, and Ravensburger published it in 1972 as a multilingual edition in Dutch, English, French, German, and Italian. A Nordic version in Danish, Finnish, Norwegian, and Swedish followed the next year; a BoardGameGeek record for a second Scandinavian edition credits Otto Maier Verlag with a 1974 release carrying product code 602 5 301 3.5 A vintage-game retrospective dates the Lakeside release to 1972.2

Isolation belonged to Lakeside's line of two-player strategy games from the 1970s, alongside Overboard, Trespass, and Blockade, and to Ravensburger's Traveller series of small-box games.3 Ravensburger reissued Isola in 1980 in a larger box whose plastic tiles sat loosely in a grid and could be pushed out downward through holes.6

Reception and legacy

The rules have spawned a family of blocking games in which board squares become condemned until a pawn is immobilized. A French survey of abstract games names Amazons, Quivive, Pontu, Gravity Trap, Pingouins, and Nowhere to Go as descendants of the same principle, and notes that Isola was itself not the first game of the type.7 The children's game Sortilèges, published in France in the 1980s, states on its rules that it is inspired by Isola and adapts the move-then-block sequence with wizards and spells on a 6×8 board.8 The game is also played informally on paper: a 7×7 grid version with the same move-and-remove sequence is a common pencil-and-paper form, and the Ludii general game system records Isolation as a blocking game played on either a 6×8 or a 7×7 board.9 • 10

Computer play

Isolation is a standard exercise in game-tree search. A widely used tutorial implements an agent with the minimax algorithm, heuristic scoring, iterative deepening, and alpha-beta pruning, moving a piece like a chess queen on a 7×7 board.9 The CodinGame bot-programming arena hosts a 9×9 port of Isola in which players practice Monte Carlo tree search and minimax under a 100-millisecond per-turn limit.11

A documented open-source agent combines iterative deepening, negamax, and a transposition table, a combination its author found at least two ply (one half-move; a single move by one player) stronger than alternatives he tested including MTD(f), killer heuristics, and aspiration windows. Its evaluation function is (myMoves−3⋅opMoves)⋅filledSpaces (\text{myMoves} - 3 \cdot \text{opMoves}) \cdot \text{filledSpaces} while both pawns share one connected region, where the coefficient 3 was tuned by testing; once the pawns are separated, the evaluation switches to comparing the sizes of the two regions, which the author reports lets the program predict winners in practice up to 25 ply ahead.12 A browser implementation runs the same family of techniques over whole turns, a move plus a removal, scoring positions by reachable territory and current move counts, with a search budget of about a third of a second.4

Small-sample online play statistics from one implementation show how balanced the game is at its size: over 145 recorded games there were 65 wins for the first player and 80 for the second, no draws, and an average of 20 moves per game.13

The isolation game on graphs

Mathematicians have generalized the board game to arbitrary graphs. In the isolation game, two players with opposite goals take turns selecting vertices, and the game isolation number ιg(G) \iota_{\mathrm{g}}(G) counts the moves in the version where the minimizing player, Dominator, starts and both play optimally; if the maximizing player Staller starts, the invariant is ιg′(G) \iota'_{\mathrm{g}}(G) .14 For the version where the goal is to isolate an edge, it is proved that ιg(G,{K2})≤∣V(G)∣/2 \iota_{\mathrm{g}}(G,\{K_2\}) \le |V(G)|/2 for any graph, with a conjecture that ⌈3∣V(G)∣/7⌉ \lceil 3|V(G)|/7 \rceil is the sharp upper bound, and exact values are given for paths in residue classes modulo 5, for example ιg(Pn,{K2})=⌊(2n+2)/5⌋ \iota_{\mathrm{g}}(P_n,\{K_2\}) = \lfloor (2n+2)/5 \rfloor when n≡i(mod5) n \equiv i \pmod 5 for i∈{1,2,3} i \in \{1,2,3\} .15 Later work determined ιg \iota_{\mathrm{g}} and ιg′ \iota'_{\mathrm{g}} exactly for all paths and cycles, proved ιg(T)≤511∣V(T)∣ \iota_{\mathrm{g}}(T) \le \tfrac{5}{11}|V(T)| for trees of order at least three, and identified the graphs attaining equality in the ∣V(G)∣/2 |V(G)|/2 bounds: two graphs for the Dominator-start game and eleven for the Staller-start game.14

References

  1. Isola (1974), LastDodo catalogue
  2. Isolation from Lakeside (1972), Toy Tales
  3. Isolation, BoardGameFYi
  4. Isolate, Eigengames
  5. Isola (Nordic second edition), BoardGameGeek
  6. ISOLA, mit 80 Spielen durch das Jahr, Luding
  7. ISOLA, Les Jeux Abstraits
  8. Sortilèges rules, Maison des Jeux de Strasbourg
  9. Playing Strategy Games With The Minimax Algorithm, freeCodeCamp
  10. Isolation (Isola), Ludii Portal
  11. Isola bot programming puzzle, CodinGame
  12. on2valhalla/Isola: A game playing AI for the Isola/Isolation board game, GitHub
  13. Isolation rules and statistics, Bodogemu
  14. Bounds on the game isolation number and exact values for paths and cycles, arXiv:2507.08503
  15. Isolation game on graphs, arXiv:2409.14180

Topic: Encyclopedia › Sports, games, and recreation › Board, card, and puzzle games › Board games › Modern designer board games › Modern abstract and tile-laying games › Amazons and isolation games

Initially written Oct 21, 2026 · Edited: Oct 25, 2026

Notice something wrong?

© 2026 EdgeChat AI, a subsidiary of Biostate AI. Free to use with credit under the Edgepedia Community License. Developers: read Edgepedia by API or MCP. Embed a reference card.

Report an error in this article

Isolation

Pick at least one reason.