Draw branches only between horizontally or vertically adjacent circles.
A numbered circle must have exactly as many branches touching it as its number.
All circles must be connected by the branches.
The branches must not form a loop. Together they must make one tree.
The puzzle is solved only when all circles are connected in one acyclic tree and every numbered circle has its exact degree. Every published Edaburi puzzle has exactly one valid solution.
A circle numbered 1 has exactly one branch. If it is a corner with only two neighbours, or if one of its neighbours is already full, the single branch it can take is decided for you.
Example: A 1 in the corner has neighbours to its right and below. The one below is a 4 that already has its four branches, so the 1 must join the circle on its right.
Count how many neighbours a circle has: two in a corner, three on an edge, four inside. When its number equals that count, every one of those branches is drawn.
Example: A 3 sits on the top edge, so it has exactly three neighbours — left, right and below. Draw all three branches immediately.
Once a numbered circle has as many branches as its number, none of its remaining gaps can ever be used. Rule them out and see what that forces on the circles across those gaps.
Example: A 2 already has both of its branches. The circle above it now has one fewer way to reach its own number, which may leave it only one option.
Subtract the branches a circle already has from its number, then count the gaps around it that could still take one. When the two match, every one of those gaps is a branch.
Example: A 3 has one branch, and only two of its remaining gaps are still usable — the third leads to a circle that is already full. Both of those two are branches.
If two circles can already be reached from one another by following branches you have drawn, the gap directly between them can never be filled: that branch would make a loop, and a tree has none.
Example: Three circles of a small square are already joined in an L. The fourth side of that square is dead — rule it out before it misleads you.
Everything has to end up in one tree, so no group of circles may be allowed to seal itself off. If a group of joined circles has only one gap left leading out of it, that gap must be a branch.
Example: A cluster in the corner is joined up and all but one of its outward gaps lead to circles that are already full. The remaining one is certain.
A finished N×N board has exactly N²−1 branches, because a tree on that many circles always does. The printed numbers add up to twice that total, which is a quick way to sanity-check a board.
Example: On a 7×7 board the finished tree has 48 branches. If the printed numbers already add up to more than 96 between them, something is wrong.
A note here is only a reminder — unlike other games on this site it does not count as a branch, so it will never satisfy a number or finish the puzzle. Use it to hold an idea while you test it.
Example: Shift-click a gap to pencil it in, follow where it leads, then draw it properly once you have proved it (or erase it once you have not).