Library / UKMT Intermediate Mathematical Challenge /219 of 267

UKMT Intermediate Mathematical Challenge, 2026

Combinatorics Difficulty 3.0 AMC 10/12 Find the answer United Kingdom

A bumblebee wants to visit all the hexagons in the diagram shown. He starts at X, only moves between hexagons that share a border, and never visits the same hexagon twice. How many possible routes could the bumblebee take?

(A) $14$ (B) $16$ (C) $18$ (D) $20$ (E) $24$

Figure for this problem

We don't reproduce this publisher's solutions. Their own solution is here — work the problem first.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: UK Mathematics Trust, licensed © UK Mathematics Trust; past papers published free at ukmt.org.uk. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.