Ticket to Ride Analysis

Ticket to Ride is a game of connecting various cities to one another following coloured routes.

I’ve done a bit of analysis on the original game, counting the number of connections, and their length. I thought it might be useful for someone else, so I’m sharing it here.

There are:

• 36 cities
• 78 total routes
• 22 doubled routes

So we have a total of 100 possible connections.

If we analyse them by the colour of the edge, then we see the following.

Length	Grey	Red	Yellow	Green	Blue	Black	Orange	White	Purple
1	9/1
2	26/14	1/0	1/0	2/0	1/0	1/0	1/0	2/0	1/0
3	6/6	2/1	2/0	1/1	2/2	2/1	2/1	1/1	2/1
4	2/2	2/2	2/1	1/1	2/2	2/1	2/0	1/1	2/2
5	0/0	1/1	1/1	2/1	1/1	1/1	1/0	2/1	1/0
6	1/1	1/1	1/1	1/1	1/1	1/1	1/1	1/1	1/1
Total	44/24	7/5	7/3	7/4	7/6	7/4	7/2	7/4	7/4

The first number in a set shows the number of routes, the second shows the number of individual routes of that colour.

The only double routes that are of one colour are grey. There are 4 double routes of length 1, and 6 of length 2.

Every colour has 7 routes. They have at least one route of every length from 2 to 6.