Back

Key West (1316)

Instruction:
Connect some orthogonally-adjacent circles with bridges so that every number in a circle is the count of the bridges connected to its circle. If two circles are orthogonally adjacent, then they must each connect to a different number of bridges. (For example, it is not allowed to have two adjacent circles that are each connected to zero bridges.) No two bridges can connect the same pair of circles. It must be possible to get from any bridge to any other bridge by travelling along connected circles and bridges.

Reference: WPF (1)

Examples:
WPF Puzzle GP 2026 - Round 5 (252)
Related puzzles:
Hashi