A colleague of mine found this puzzle somewhere on the interwebs and brought it scribbled on a piece of paper. I made a printable model and he wrote a program to search for solutions. The longest path the program was able to find in a couple of hours was 32 hexes long. Can you find a better one? The rule is simple: one continuous path. Ignore all unconnected segments.

Printed using PLA, 0.2mm layers. The secondary color is 3 layers thick.

Both included files contain full set of pieces. The 3mf already contains configuration for filament change in PrusaSlicer.