Added Chain merging

src/main/java/logic/Chain.java

@@ -56,4 +56,32 @@ protected Set<Coords> getLiberties() {
     protected boolean isAdjacentTo(Coords coords) {
         return liberties.contains(coords);
     }
+
+    protected boolean isAdjacentTo(Chain other) {
+        for (Coords lib : liberties)
+            if (other.contains(lib))
+                return true;
+
+        return false;
+    }
+
+    protected int size() {
+        return stones.size();
+    }
+
+    private void clear() {
+        stones.clear();
+        liberties.clear();
+    }
+
+    protected void mergeChain(Chain other) {
+        if (!isAdjacentTo(other))
+            throw new IllegalArgumentException("Chains are not adjacent and cannot be merged.");
+
+        stones.addAll(other.stones);
+
+        other.clear();
+
+        recalculateLiberties();
+    }
 }

src/test/java/logic/ChainTest.java

@@ -39,10 +39,13 @@ public void contains() {
     @Test
     public void adjacency() {
         Chain chain = new Chain(getCoords(4, 4));
+        Chain other = new Chain(getCoords(3, 4));
 
         assertThat(chain.isAdjacentTo(getCoords(3, 4)), is(true));
 
         assertThat(chain.isAdjacentTo(getCoords(3, 3)), is(false));
+
+        assertThat(chain.isAdjacentTo(other), is(true));
     }
 
     @Test
@@ -62,4 +65,28 @@ public void liberties() {
 
         assertThat(liberties.size(), is(2));
     }
+
+    @Test
+    public void size() {
+        Chain chain = new Chain(getCoords(1, 1));
+
+        assertThat(chain.size(), is(1));
+    }
+
+    @Test
+    public void merge() {
+        Chain main = new Chain(getCoords(4, 4));
+        Chain other = new Chain(getCoords(3, 4));
+
+        main.mergeChain(other);
+
+        assertThat(main.size(), is(2));
+        assertThat(other.size(), is(0));
+
+        assertThat(main.contains(getCoords(4, 4)), is(true));
+        assertThat(main.contains(getCoords(3, 4)), is(true));
+
+        assertThat(main.getLiberties().size(), is(6));
+        assertThat(other.getLiberties().size(), is(0));
+    }
 }