# Serpentiles

Serpentiles is the name coined by Kurt N. Van Ness for the hexagonal tiles used in various edge-matching puzzle connection abstract strategy games, such as Psyche-Paths, Kaliko, and Tantrix.[1] For each tile, one to three colors are used to draw paths linking the six sides together in various configurations. Each side is connected to another side by a specific path route and color. Gameplay generally proceeds so that players take turns laying down tiles. During each turn, a tile is laid adjacent to existing tiles so that colored paths are contiguous across tile edges.

Serpentiles is also the name of a single-player puzzle connection game developed by Brett J. Gilbert and published by ThinkFun in 2008. The Serpentiles (2008) game includes square (1×1) and rectangular (2×1) tiles and challenge cards which provide a list of tiles that should be arranged to make a contiguous path.

## Tile notation

Van Ness also coined a three-digit notation for tile categories, based on the paths shown on the tiles. The notation xyz refers to:[2]

• x = number of paths linking sides with adjacency 3, 2 segments apart (opposite sides)
• y = number of paths linking sides with adjacency 2, 1 segment apart

It should be clear that adjacency 3 is the maximum. Because there are six sides, there are three paths between the sides, and the sum of the digits in the notation is always three. Van Ness also published a mathematical description: ${\displaystyle \sum _{n=1}^{3}10^{n-1}a_{n}}$ where ${\displaystyle a_{n}}$ is the count of segments with adjacency ${\displaystyle n}$.[2] There are five distinct combinations of six sides and three paths,[3] ignoring for now the possibility of changing path color:

### Rotational position

An orthogonal rotation that leaves the hexagon in the same orientation (with flat sides to the left and right) is 60°. There are six potential orthogonal rotational positions (360°/60°) of the regular six-sided hexagon. By examination, 300 has rotational symmetry: any rotation of 60° will result in the same sides being linked, so 0300 has one unique rotational position. Similarly, 003 has two unique rotational positions; one rotation of 60° will result in different sides being linked by the paths, but a second rotation of 60° in the same direction will result in the original sides being linked again. In a similar fashion, 102 and 120 both have three unique rotational positions, and 021 has six unique rotational positions.

Orthogonal rotations of 003
Orientation 12-34-56
Orientation 23-45-61, after one orthogonal rotation

To uniquely describe each rotational position, imagine a reference frame is applied where each side is numbered from 1 to 6 sequentially anti-clockwise. The paths connecting sides can be described as linked pairs.

For example, for 003 above, proceeding anti-clockwise from the lower right edge, the path/pair notation is 12-34-56. A single orthogonal rotation of the shape will add one (if anti-clockwise) or subtract one (if clockwise) to each number, modulo 6. In this way, the linked paths with an orthogonal rotation (60°) anti-clockwise would change to 23-45-67, or rewriting using modulo 6, 23-45-61, demonstrating that different sides are linked with a single orthogonal rotation. The specific order within a pair and the order in which the pairs are written does not affect the configuration. For example, 23-45-61 is equivalent to 23-45-16 and 16-23-45. Thus with a second orthogonal rotation, which results in 34-56-12, it is simple to demonstrate the second orthogonal rotation is equivalent to 12-34-56, the original orientation.

The reference frame could also be numbered sequentially in a clockwise fashion. In that case, a clockwise rotation would increment the values by 1, while an anti-clockwise rotation would decrement the values by 1. The orientation of the reference frame (clockwise or anti-clockwise) only affects the arithmetic required to rotate the tile. Likewise, the choice of origin (which side is designated the first side) for the reference frame is arbitrary, but the reference frame remains fixed during rotation.

Class Unique
rotational
positions
Gallery of positions
003 2
021 6
102 3
120 3
300 1

Describing the tiles by linked sides also implicitly includes the three-digit Van Ness notation. For any arbitrary three-pair sequence AB-CD-EF, the Van Ness notation can be recovered by the following formula: ${\displaystyle 10^{[min(\left\vert B-A\right\vert ,6-\left\vert B-A\right\vert )-1]{\bmod {3}}}+10^{[min(\left\vert D-C\right\vert ,6-\left\vert D-C\right\vert )-1]{\bmod {3}}}+10^{[min(\left\vert F-E\right\vert ,6-\left\vert F-E\right\vert )-1]{\bmod {3}}}}$

### Regular 4-sided square

Although a regular six-sided polygon (hexagon) can be used to cover a plane surface without gaps, a regular four-sided polygon (square) also can be used. The square with two paths linking sides can be described in a similar fashion, using a two-digit notation yz; there are just two potential configurations.[3]

Like the hexagonal case, 20 (where all paths link opposite sides) has rotational symmetry. It is clear that 02 does not have rotational symmetry, as rotating the tile 90° clockwise or anti-clockwise will link different sides. Compare with the same tile rotated by 90°: Square tiles that lack rotational symmetry are known as Truchet tiles, as described in a 1704 memoir by Sébastien Truchet entitled "Mémoire sur les combinaisons" and popularized in 1987 by Cyril Stanley Smith.[4][5]

### Regular 8-sided octagon

Likewise, a regular eight-sided polygon (octagon) can have four paths pairing the eight sides, described using Van Ness's notation in a similar way with a four digit notation wxyz. There are 18 distinct combinations:[3]

As with the preceding hexagon and square examples, the case linking all the opposite sides (4000) has rotational symmetry. Note that for the octagon, the notation no longer uniquely describes the path configuration. There are two duplicate notations in the gallery: 0121 and 1111. The 1111 pair are mirror-images. The rotational position notation can be applied to distinguish these tiles; with a reference frame numbered anti-clockwise starting from the bottom edge, 0121(a) above can be written as "0121 12-36-47-68", which is distinct from 0121(b): "0121 12-38-46-57". Likewise, 1111(a) is "1111 12-36-48-57", distinct from 1111(b): "1111 13-25-48-67". Using modular arithmetic (modulo 8), 1111(a) and (b) can each be rotated by one orthogonal rotation (45°) anti-clockwise to positions "15-24-36-78" and "15-68-47-23", respectively, demonstrating their paired reflective symmetry.

These octagonal tiles could be combined with the square tiles described here (rotated through 45° to fill the interstitial spaces) to completely tile a surface with paths across all edges.[6]

### Regular polygons with 2 entry points per side

The preceding discussion covered the cases of regular 4-, 6-, and 8-sided polygons with a single entry point per side, with each side linked by a path. Because the paths link two different sides, using a single entry point per side requires regular 2n-sided polygons with an even number of sides to ensure that all entry points are linked by paths. If there are tiles with an odd number of sides, an even number of entry points would similarly ensure that all entry points are linked by paths.

Both 003(a) and (b) are reproduced here; the (b) variant is recovered by the inscribed triangle.

For example, a regular 3-sided polygon (equilateral triangle) could have 2 entry points per side. There are 7 potential combinations using 3 paths per tile, depicted above.[3] Although the Van Ness notation can be applied by modifying it to count adjacency rather than sides, each tile is not uniquely described by the Van Ness notation, although the relationship between the 003(a) and (b) cases can be seen by inscribing a triangle, as the example shown here. A similar triangle could be inscribed for the 021(a) case to demonstrate its relationship to 021(b).

It may be simpler to describe the tile by path pairings instead. In the set of three-sided tiles with two entry points per side and three paths, the numbering starts from the left-hand point on the bottom edge and proceeds sequentially anti-clockwise.

One complete rotation turns the tile by 120° (=360°/3 sides). Rotation arithmetic is performed by adding two, modulo six. Consider the tile (12-34-56). Rotating the tile one or more complete rotations will, by inspection, not change the points that are linked. To demonstrate this, one rotation anti-clockwise results in the configuration (34-56-78), or, after the modulo arithmetic is performed, (34-56-12), which can be rearranged to (12-34-56), showing that one rotation does not affect the linked paths and so there is one distinct rotational position for this tile. On the other hand, consider the tile (13-26-45). The first two anti-clockwise rotations of this tile result in the configurations (16-24-35) and (15-23-46), respectively, so this tile has three distinct rotational positions.

Similarly, a regular 4-sided polygon (square) with 2 entry points per side has 35 potential combinations using 4 paths per tile.[3] The complete rotation is 90° and the rotational symmetry can be determined by adding 2, modulo 8 in a manner similar to that for the equilateral triangle case above. This set of four-sided polygons with two entry points per side and four paths per tile is used in the commercial board game Tsuro.

Inscribed relationships
0400(a), inscribed 0400(b)
1111(x), inscribed 1111(a)

In some cases, the (a) and (b) [or (a) and (x)] pairings can be recovered by inscribing a square in similar fashion. In other cases, the [(a) & (b)] or [(x) & (y)] sets are mirror-image pairs.

### Generalization to regular polygons

For the general case where the tiles are n-sided regular polygons with m entry points per side so the product of n and m is even, the number of distinct combinations can be computed as ${\displaystyle A(n,m)}$.[3]

${\displaystyle A(n,m)={\frac {1}{n}}\cdot \sum _{n=pq}\varphi (p)\cdot \alpha (p,mq)}$

${\displaystyle \varphi (p)}$ is Euler's totient function, where ${\displaystyle \varphi (p)=r\prod _{p\mid r}\left(1-{\frac {1}{p}}\right)}$
${\displaystyle \alpha (p,mq)}$ is a conditional function defined as:
${\displaystyle \alpha (p,mq)={\begin{cases}\sum _{0\leq 2j\leq mq}p^{j}{\dbinom {mq}{2j}}(2j-1)&{\text{if }}p{\text{ is even}}\\p^{\frac {mq}{2}}(mq-1)&{\text{if }}p{\text{ is odd}}\end{cases}}}$

For example, a 10-sided decagon with a single path per side (5 paths total) has 105 combinations.[3]

m Entry points per side 0 1 2 3 4 5 6 7 1 1 2 5 18 1 1 3 15 105 1 1 3 11 65 513 5363 68219 N/C 1 7 3483 N/C N/C 1 2 35 2688 508277 N/C N/C N/C N/C 1 193 N/C N/C N/C 1 5 1799 N/C N/C N/C N/C N/C N/C 1 19311 N/C N/C N/C 1 18 254143 N/C N/C N/C N/C N/C N/C 1 N/C N/C N/C N/C 1 105 N/C N/C N/C N/C N/C N/C N/C

(Many of the values from the original source are N/C, meaning not computed)[3]

## Variations

Games using Serpentiles
Name Year Path colors Tile material Tile count Notes
Psyche-Paths 1969 3
•
•
•
Cardboard   85 + 6 blank
Kaliko early 1980s 3
•
•
•
Lucite   (clear) 85 Lucite pieces until 2001. Current printing uses bamboo/wooden tiles.
Wood
Tantrix 1988 4
•
•
•
•
Plastic   56 Up to three colors appear on a single tile. Tiles are numbered on the reverse. Triple Cross tiles not used.

### Psyche-Paths

A game of Psyche-Paths requires one to six players. Players take turns laying down tiles. Each tile laid down next to tiles that have already been laid must continue the color of the path(s) on the existing adjacent edge(s). Six blank tiles are provided as "wild cards" and are considered to continue any adjacent path. One tile is drawn at the start of the game and placed in the middle of the playing field to "seed" the game.[7]

In "Beginner" Psyche-Paths, players draw one tile from a pool of face-down tiles when it is their turn. One point is awarded for each connected path. If the player is unable to play the tile or makes an illegal play, it is retained and the player is penalized a number of points equal to the number of paths running through the retained tile at the end of the game.[7]

In "Standard" Psyche-Paths, two to four players each draw a hand of six tiles at the start of the game. During each turn, players may play any or all of their tiles, replenishing to a hand of six tiles at the end of their turn from the pool of face-down tiles. When laying down tiles, points are awarded only when two or more ends of an existing path is connected. The player scores a number of points equal to the number of tiles containing the connected color path. Three points are awarded if the path crosses itself, and the score is doubled if the path is closed. No penalty is taken for leftover tiles.[7] "Classic" Psyche-Paths is similar to "Standard", but adds a rule that each move must result in a single path through all the tiles in that move.[7]

"Solitaire" Psyche-Paths does not have specific rules, but rather suggestions, such as building alternating rows of eight and nine pieces in length using legal moves.[7]

### Other games using regular polygonal tiles

Square tiles are used in connection games such as the Black Path Game (with a single-colored path) and Trax (with two colored paths). Octagonal tiles with a single path color are used with interstitial spaces and a game board with pre-printed links for the game Octiles.[8][9]

The Serpentiles (2008) game was developed by Brett J. Gilbert[10] and published by ThinkFun in 2008.[11] The Serpentiles (2008) game includes 19 plastic tiles: 4 square (1×1) and 12 rectangular (2×1) tiles with one printed green or blue path on each, and 3 square (1×1) node tiles with coincident blue and green path termini. The 2008 game also includes 40 challenge cards which provide a list of tiles (including two of the nodes) to be arranged so that one contiguous path of each color is made.[12]

## History

The original hex-tile edge-matching connection game, Psyche-Paths, was designed by Charles Titus and Craige Schensted and published in the 1960s[13] with the 85 unique tile combinations and 6 blank "wild cards" on cardboard tiles.[7] In a review, researchers noted the game "accommodates a wide variety of ages, interests, and playing styles ... [involving] a number of skills that are of special interest to teachers and parents."[14] Steve Titus, the son of Charles, reissued the game in the 1980s as Kaliko using screen-printed acrylic tiles under the family business Future Games. Kaliko was licensed to Kadon in 1986 with a switch to wood tiles after 2001.[15]

Tantrix was released in 1988 by inventor Mike McManaway using four of the five possible path combinations (using Van Ness's notation: 003, 021, 102, and 120, excluding 300) to create 56 unique tiles, each with three different colors chosen from a palette of four. The primary innovation of Tantrix is the encoding of numbers on the reverse side of the tiles, allowing subsets of the 56 to be used for solitary puzzles.[16]

## Hex tile sets

The complete set of 85 tiles, assuming a combination of up to three distinct path colors per tile, is shown in the table below, organized by notation and number of colors.

003 aka Triple Bend
One
Color
Two Colors Three Colors

021 aka Single Cross or Cross Bend
One
Color
Two Colors Three Colors

102 aka Double Bend
One
Color
Two Colors Three Colors

120 aka Double Cross
One
Color
Two Colors Three Colors

300 aka Triple Cross
One
Color
Two Colors Three Colors

Tantrix uses the subset of tiles with three different path colors exclusively, and excludes the 300 Triple Cross series. With four possible path colors in Tantrix, there are four different color combinations with three different path colors, which gives 56 unique Tantrix tiles in a complete set:

• 003: 2 tiles with 3 path colors × 4 path color combinations = 8 Tantrix tiles in set 003
• 021: 6 tiles with 3 path colors × 4 path color combinations = 24 Tantrix tiles in set 021
• 102: 3 tiles with 3 path colors × 4 path color combinations = 12 Tantrix tiles in set 102
• 120: 3 tiles with 3 path colors × 4 path color combinations = 12 Tantrix tiles in set 120
Tantrix tiles
Class/Set Paths
•
•
•
Paths
•
•
•
Paths
•
•
•
Paths
•
•
•
003
#14

#03

#21

#23

#25

#28

#43

#45
021
#01

#11

#08

#17

#19

#31

#29

#37

#41

#53

#55

#46

#10

#12

#07

#18

#20

#33

#27

#38

#36

#54

#56

#52
102
#02

#13

#05

#22

#16

#15

#26

#30

#24

#49

#47

#48
120
#06

#09

#04

#35

#34

#32

#42

#40

#39

#44

#50

#51

## References

1. ^ Van Ness, Kurt N. "Serpentiles". van-ness.com. Retrieved 8 October 2017.
2. ^ a b Van Ness, Kurt N. "Serpentile Descriptors". van-ness.com. Retrieved 8 October 2017.
3. "Number of distinct Tsuro tiles which are square and have n points per side". The On-line Encyclopedia of Integer Sequences. July 9, 2014. Retrieved 31 May 2022.
4. ^ Browne, Cameron (2008), "Truchet curves and surfaces", Computers & Graphics, 32 (2): 268–281, doi:10.1016/j.cag.2007.10.001.
5. ^ Smith, Cyril Stanley (1987), "The tiling patterns of Sebastian Truchet and the topology of structural hierarchy", Leonardo, 20 (4): 373–385, doi:10.2307/1578535. With a translation of Truchet's text by Pauline Boucher.
6. ^ Garrity, Mike (January 7, 2012). "Path Tile Games". From Here to There. Retrieved 31 May 2022.
7. "Psyche-Paths: Instructions". Funtastic, a Division of KMS Industries, Inc. 1969. Retrieved 8 October 2017.
8. ^ O'Sullivan, Steffan (February 14, 1998). "Octiles, Designed by Dale Walton". Panix. Retrieved 26 May 2022.
9. ^ "Octiles: Rules of play". Kadon Enterprises. Retrieved 26 May 2022.
10. ^ "Serpentiles, published by ThinkFun". Brett J. Gilbert. Retrieved 23 September 2022.
11. ^ "New ThinkFun Products for Spring of 2008" (Press release). ThinkFun. February 8, 2008. Retrieved 23 September 2022.
12. ^ "Serpentiles from Thinkfun". The Puzzle Den [blog]. January 12, 201. Retrieved 23 September 2022.
13. ^ Browne, Cameron (2005). "8: Connective Goal". Connection Games: Variations on a Theme. Boca Raton, Florida: CRC Press. p. 287. ISBN 978-1-56881-224-3. Retrieved 29 May 2022.
14. ^ Parkis, Michael; Shea, Julia (1971). "Simulation Review". Simulation & Games. 2 (2): 233–236. doi:10.1177/003755007122009. hdl:2027.42/68407.
15. ^ "Kaliko: Larger image and brief history". Kadon Games. November 2003. Retrieved 8 October 2017.
16. ^ Browne, Cameron (2015). "Game Design Patterns: Explore the Design Space". Game & Puzzle Design. Raleigh, North Carolina: Lulu Press Inc. 1 (2): 75. ISBN 9781326494322. ISSN 2376-5097. Retrieved 8 October 2017.