Rules
You are given a square grid, with numbers (0-9) in some of its cells. You have to connect some of the numbers, so that each "island" of numbers has the same total sum. A number can have anywhere from 0 to 4 connections that go straight up, down, left or right. Two connections may never intersect.
Some notes:
- You can't just connect all numbers together, you must have at least 2 "islands" of numbers.
- The only place a T-intersection may happen is at a number, not in an empty cell.
Solved examples
Here the sum of every group is 3 (note that the lonely 3 is still a valid group)
1-----1 1
| 3 |
1 2--0
Alternate solution
1-----1--1
3
1-----2--0
A bigger example
1--0--3 5
| | |
| 2-----4 |
| |
8 7-----6
Problem
Here are a few textual versions of the image.
Compressed:
2 00
3 02 3
0 140
4 3 4
023
01 25
3 1 22
46 3
Another version, easier to read:
2 0 0
3 0 2 3
0 1 4 0
4 3 4
0 2 3
0 1 2 5
3 1 2 2
4 6 3
EDIT: Ok, It seems to be quite easy, right? Now here is a harder challenge: Can you split it into a maximal number of "islands"? (Thanks to @ghosts_in_the_code for this addition)