**Last edit**

Summary: Repairing the link to the parent game page.

**Changed:**

< This is an AutoGeneratedTextVersion of **[:../:this game]**

**to**

> This is an AutoGeneratedTextVersion of **[[Matrix]]**

This is an AutoGeneratedTextVersion of Matrix

Version 1.0 December 7, 2003

(c) 2003 Jeff Barrett

For one player: About 20 minutes

*Case sat in the loft with the dermatrodes strapped across his forehead, watching motes dance in the diluted sunlight filtered through the grid overhead. A countdown was in progress in one corner of the monitor screen.*

*The screen bleeped a two-second warning.*

*And one and two and --*

*Cyberspace slid into existence from the cardinal points.*

from *Neuromancer* by William Gibson

Tiles | Data Structures |

Null Tiles (4) | Data Forts |

Other Tiles (20) | Ice |

Colored Pawns (4) | Ice Breakers |

Coins (5 in each color) | Power-Up Tokens |

Generic Counters (10) | Brain Damage |

Six-Sided Die | Blind Luck |

Runs are made on the matrix (a smooth, clear surface). The matrix has the structure of a two-dimensional grid. Ice and data forts are placed into the grid as they are encountered.

- Choose an ice breaker (a pawn) and a space contiguous in the matrix contiguous to the ice breaker. An ice breaker in the matrix is contiguous to the four cardinal spaces (located up, down, left, and right). Diagonal spaces are not contiguous to an ice breaker in the matrix. All spaces in the matrix are contiguous to an ice breaker that is outside the matrix. 2. If the chosen space in the matrix contains neither ice nor a data fort, install the top data structure from the data stack into the space and place on it a power-up token of the same color as the data structure. A data structure may only be contiguous to at most
**three**other data structures. If installing a new data structure would violate this condition, it may not be installed. If the data structure can be installed, continue to step 3; otherwise, go back to step 1 and choose a new contiguous space. 3. If the chosen space contains ice or a data fort**and no ice breaker**, roll the die to determine the current strength of the ice breaker. If the ice breaker color is the same as the ice or data fort color, the breaker strength is equal to the die roll plus one; otherwise, the breaker strength is equal to the die roll. In either case, the strength of the breaker can be increased by one for each power-up of the ice or data fort color discarded at this time. 4. If the ice breaker strength is greater than the data-structure strength, then the ice or fort is successfully broken. The strength of ice is equal to the number on the tile. The strength of a data fort is equal to six. Move the ice breaker onto the data structure and collect the power-up token on the data structure if there is one. The power-up token represents knowledge gained. In case of success, skip to step 6; otherwise, continue to step 5. 5. If the ice breaker strength is less than or equal to the data-structure strength, take one brain damage. If the data structure is ice, then move the ice breaker onto the ice and collect the power up token on the data structure if there is one. The result of failing to break ice is just brain damage. But an ice breaker can only move onto a data fort if the breaker strength is**seven or greater**(that is, strictly greater than the fort strength of six). The result of failing to break a fort is brain damage and the inability to infiltrate the fort. The breaker stays where it is. 6. If the total amount of brain damage taken during the run is greater than or equal to ten, then the run ends immediately in brain death; otherwise, continue to step 7. 7. If each data fort is occupied by the corresponding ice breaker (the ice breaker of the same color), then**the run ends immediately and the runner wins**; otherwise, return to step 1.

Distance to a target is the shortest number of steps **along a path of data structures** that would move a breaker to the target. Only steps in the four cardinal directions are allowed. And the distance is undefined if there is no continuous path along data structures to the target. A breaker outside the matrix is distance one to each installed data structure. The distance from any location inside the matrix to a location outside the matrix is undefined.

The note d6 means the result of the roll of a six-sided die. The strength of an ice breaker is never less than zero.

Some ice breakers are stronger than others. Some work well only when appropriately matched. The standard way to choose an icebreaker is to pick one of the four pawns, then roll d6 to determine what ice breaker of that color the pawn will represent on the next run.

**Self-Fragment LISP**

Strength: d6 minus one

Ability: Take one brain damage to trade the position of this ice breaker with the position of any other ice breaker in or out of the matrix. 2.**Ankara**

Strength: d6 minus one

Ability: Take one brain damage to increase the strength of Ankara by two on its next challenge. This ability may be used multiple times before the challenge. 3.**Black Diamond**

Strength: d6 minus one

Ability: Take two brain damage to increase the strength of all ice breakers within distance five of Black Diamond by three for their next challenge. 4.**Kuang Grade Mark Eleven**

Strength: d6 minus one

Ability: Take one brain damage to challenge directly any data structure within distance d6. Take the brain damage before rolling for the maximum distance to the target. 5.**Assimilation Kuang**

Strength: d6 minus 1

Ability: Pay one of each color power-up (four total) and take one brain damage to move this breaker onto any installed data structure. Can move onto a data structure occupied by another ice breaker. 6.**Wintermute Compiler**

Strength: 0

Ability: Take one brain damage to set the strength of Wintermute Compiler to 10 for its next challenge.

**Turing Scout Construct**

Strength: 3

Ability: If in the matrix, the strength of Turing Scout is equal to three plus the number of other ice breakers within distance three. 2.**Trinity Prep**

Strength: d6 minus one

Ability: If in the matrix, Trinity may use the sum of the strengths of all contiguous ice breakers as its own strength. Diagonal spaces are not contiguous. 3.**Klein Liar**

Strength: d6 minus one

Ability: One may use any color of power-up token to increase strength of Klein Liar by one. 4.**Finn Construct**

Strength: d6 minus one

Ability: If Finn Construct is in the matrix, one may take two brain damage and pay one power-up token to switch the positions of any two ice breakers. The color of the power-up token must match the color of one of the ice breakers switched. 5.**Flatline Dix**

Strength: d6 minus one

Ability: The strength of all ice breakers within distance three is increased by one for their next challenge. 6.**Case-Curry Construct**

Strength: d6 minus one

Ability: If in the matrix, pay one of each color power-up token and take one brain damage to exchange the locations of any or all ice breakers in or out of the matrix. The same data structures that were occupied by an ice breaker before the exchange should be occupied after (possibly by a different ice breaker), and the same number of ice breakers (thought possibly different) should be outside the matrix).

**Sendai Sub-Street**

Strength: 3

Ability: Each red power-up increases the strength of Sub-Street by two. 2.**Chiba Cross Talk**

Strength: d6 minus one

Ability: May challenge any data structure within distance two. 3.**Hosaka Prime**

Strength: d6 minus one

Ability: If Hosaka Prime is on a red data structure, add three to its strength. 4.**Sliver Virus**

Strength: d6 minus one

Ability: Pay one red power up token to set the strength of Sliver Virus equal to the total number of installed red data structures (ice and forts) plus one. Pay one red power-up token at any time to reduce permanently the strength of the data structure Sliver Virus currently occupies by two. 5.**Cray Envelope**

Strength: 1 if outside the matrix.

Ability: If Cray Envelope is in the matrix, its strength is determined by the color of the data structure it currently occupies: strength 1 if on blue, strength 4 if on green, strength 5 if on black, strength 10 if on red. 6.**Tessier-Ashpool S.A. Stealth Blade**

Strength: d6 minus one

Ability: Instead of rolling for strength, the strength of Stealth Blade may be set to one plus the distance to the nearest other ice breaker. This ability can only be used in the matrix and only if at least one other ice breaker is in the matrix.

**Zion Loop**

Strength: d6 minus two

Ability: If currently on a blue data structure, strength of Zion Loop is d6 plus the strength of data structure. 2.**Dub Lattice**

Strength: d6 minus two

Ability: If in the matrix, instead of rolling for strength, the strength of Dub Lattice may be set to three plus the number of blue data structures within distance four. 3.**Babylon Q**

Strength: d6 minus two

Ability: Pay any two power-up tokens and take one brain damage to move the data structure occupied by Babylon Q to any place in the matrix where it might be legally installed. Babylon Q moves with the data structure. 4.**Dahlia Mix**

Strength: d6 minus two

Ability: Pay any two power-up tokens and take one brain damage to exchange the data structure occupied by Dahlia with any other unoccupied data structure in the matrix. Dahlia moves with her current data structure. 5.**Viral Dub**

Strength: d6 minus two

Ability: Pay one blue power up and take one brain damage to exchange the positions of two unoccupied data structures in the matrix. Viral Dub must be contiguous with at least one of the exchanged data structures. 6.**Enigma**

Strength: d6 minus two

Ability: Pay two blue power-up tokens and take one brain damage to exchange the positions of any or all**data forts**currently installed in the matrix. Breakers occupying forts move with the forts.

The author hereby grants permission to redistribute the rules of this game as long as they are distributed freely and without alteration. Best gaming wishes.