My friends and I are new to Settlers of Catan. We had a dispute over what counts as the longest road. Suppose we have a road that is 8 segments long. Between the 4th and 5th segment we have a road coming off it that is 2 segments long, does this count as that person's road being 10 segments long?

Pictured: For the Longest Road, does this count as 8 segments long, or 10?

S           S — — S
 \         /
  \       /
   S — — S

Assuming all roads and settlements are from the same player, where:

S : Settlement  
\ : Road  
/ : Road  
— : Road

The Argument: One friend was arguing that because the road is not broken by another player, it is 10 segments long while another was arguing that the longest road should be able to be taken in 1 trip, so it is 8 segments long. We know that the rule is given as

"The Longest Road is a continuous road connecting two intersections, which consists of at least 5 individual road pieces and is not interrupted by game pieces belonging to other players. It has more individual road pieces than any other connecting road of this type."

But we were unable to determine which it should be.

  • 3
    > "The Longest Road is a continuous road connecting two intersections," To count 10 segments, you'd be connecting three intersections instead of two, which isn't allowed.
    – studog
    Commented Feb 3, 2017 at 23:02

2 Answers 2


It's 8 segments. The game rules say:

The first player to build a continuous road (not counting forks) of at least 5 road segments, receives the Special Card “Longest Road”. [...]

so you don't get to count the two-segment fork.

  • If your road makes a lariat (a closed loop with a single branch) would the entire road count?
    – Nick T
    Commented Feb 19, 2015 at 18:07
  • 3
    Yes. The rule is "not counting forks".
    – Nelson
    Commented Feb 19, 2015 at 18:15
  • @Cascabel : Concerning "The first player to build a continuous road...".I would add that the next player to build a longer road takes the "Longest Road" Special Card away from the previous owner. Commented Jan 2, 2020 at 15:47

The way I look at it is as if you where drawing a path between two points on the board with your finger. In order to determine the longest path it would be how far you can move your finger between points without lifting it (break in path) or moving over the same path again.

 S ___ ___ S ___ ___ S ___ ___ S ___ ___ S
(A)                  |                  (B)

In the example you gave I could move over 6 roads going from point A->C(C->A) or B->C(C->B) and over 8 going from A->B(B-A) and if I attempted to include all 3 points I would have to include 2 sections of road in my path twice which breaks the path.

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .