Lookerup docstring

Author: marcharper

axelrod/strategies/lookerup.py

@@ -31,11 +31,10 @@ class LookerUp(Player):
 
     where m and n are both zero. Tit-For-Tat is given by:
 
-        {
-        ('', 'C', 'D'): D,
-        ('', 'D', 'D'): D,
-        ('', 'C', 'C'): C,
-        ('', 'D', 'C'): C,
+        {('', 'C', 'D'): D,
+         ('', 'D', 'D'): D,
+         ('', 'C', 'C'): C,
+         ('', 'D', 'C'): C,
         }
 
     where m=1 and n=0.
@@ -44,11 +43,8 @@ class LookerUp(Player):
     opposed to most recent actions) will have a non-empty first string in the
     tuple. For example, this fragment of a dict:
 
-        {
-        ...
-        ('C', 'C', 'C'): C.
-        ('D', 'C', 'C'): D,
-        ...
+        {('C', 'C', 'C'): C,
+         ('D', 'C', 'C'): D,
         }
 
     states that if self and opponent both cooperated on the previous turn, we
@@ -59,11 +55,8 @@ class LookerUp(Player):
     (so m or n are greater than 1), simply concatenate the strings together.
     Below is an incomplete example where m=3 and n=2.
 
-        {
-        ...
-        ('CC', 'CDD', 'CCC'): C.
-        ('CD', 'CCD', 'CCC'): D,
-        ...
+        {('CC', 'CDD', 'CCC'): C,
+         ('CD', 'CCD', 'CCC'): D,
         }
     """