## Deltoidal Trihexagonal Tree

This type is an adaptation of Branch (ブランチャー) by Inaba Naoki to a Deltoidal Trihexagonal grid.

### Rules

Draw segments to create a network such that:

1. Every vertex • and node O is connected.
2. Vertices must connect to exactly two path segments.  Every branch of the network must form a path from one node to another.
3. Numbers indicate the sum of the lengths of every branch directly connected to that node, in segments.
4. The network is acyclic – there are no loops.

### Puzzles

All of the puzzles can be found organized in this printable PDF, or in the images below.

PDF Deltoidal Trihexagonal Tree