This type is an adaptation of Branch (ブランチャー) by Inaba Naoki to a Deltoidal Trihexagonal grid.
Draw segments to create a network such that:
- Every vertex • and node O is connected.
- Vertices must connect to exactly two path segments. Every branch of the network must form a path from one node to another.
- Numbers indicate the sum of the lengths of every branch directly connected to that node, in segments.
- The network is acyclic – there are no loops.
All of the puzzles can be found organized in this printable PDF, or in the images below.
PDF Deltoidal Trihexagonal Tree