# TetraVex

(Redirected from Tetravex)

TetraVex is a puzzle computer game, available for Windows and Linux systems.

## Gameplay

TetraVex is an edge-matching puzzle. The player is presented with a grid (by default, 3x3) and nine square tiles, each with a number on each edge. The objective of the game is to place the tiles in the grid in the proper position as fast as possible. Two tiles can only be placed next to each other if the numbers on adjacent faces match.

## Availability

TetraVex was originally available for 16-bit Windows in Windows Entertainment Pack 3. It was later re-released as part of the Best of Windows Entertainment Pack.

TetraVex is also available as an open source game on the GNOME desktop as part of the GNOME Games collection under GNU GPL.[1]

A 32-bit Windows version was written in Delphi by Mark Billig [2]

## Origins

Solved Tetravex with Blibbet

The original version of TetraVex (for the Windows Entertainment Pack 3) was written (and named) by Scott Ferguson who was also the Development Lead and an architect of the first version of Visual Basic.[3] TetraVex was inspired by "the problem of tiling the plane" as described by Donald Knuth on page 382 of Volume 1: Fundamental Algorithms, the first book in his The Art of Computer Programming series.

In the TetraVex version for Windows, the Microsoft Blibbet logo is displayed if the player solves a 6 by 6 puzzle as seen in the image to the right.

The tiles are also known as McMahon Squares, named for Percy McMahon who explored their possibilities in the 1920s.[4]

## Counting the possible number of TetraVex

On a ${\displaystyle n\times {}n}$ board there are ${\displaystyle n(n-1)}$ horizontal and vertical pairs that must match and ${\displaystyle 4n}$ numbers along the edges that can be chosen arbitrarily. Hence there are ${\displaystyle 2n(n-1)+4n=2n(n+1)}$ choices of 10 digits, i.e. ${\displaystyle 10^{2n(n+1)}}$ possible boards. Deciding if a TetraVex puzzle has a solution is in general NP-complete.[5]