Reformat to fit in 80 columns.

darius · darius · commit da791121297e · 2011-10-09T16:26:35.000Z
diff --git a/csp.py b/csp.py
@@ -342,8 +342,8 @@ def parse_neighbors(neighbors, vars=[]):
         UT: WY CO AZ; MT: ND SD WY; WY: SD NE CO; CO: NE KA OK NM; NM: OK TX;
         ND: MN SD; SD: MN IA NE; NE: IA MO KA; KA: MO OK; OK: MO AR TX;
         TX: AR LA; MN: WI IA; IA: WI IL MO; MO: IL KY TN AR; AR: MS TN LA;
-        LA: MS; WI: MI IL; IL: IN KY; IN: OH KY; MS: TN AL; AL: TN GA FL; MI: OH IN;
-        OH: PA WV KY; KY: WV VA TN; TN: VA NC GA; GA: NC SC FL;
+        LA: MS; WI: MI IL; IL: IN KY; IN: OH KY; MS: TN AL; AL: TN GA FL;
+        MI: OH IN; OH: PA WV KY; KY: WV VA TN; TN: VA NC GA; GA: NC SC FL;
         PA: NY NJ DE MD WV; WV: MD VA; VA: MD DC NC; NC: SC; NY: VT MA CT NJ;
         NJ: DE; DE: MD; MD: DC; VT: NH MA; MA: NH RI CT; CT: RI; ME: NH;
         HI: ; AK: """)
@@ -491,9 +491,9 @@ class Sudoku(CSP):
                       for v in flatten(rows)])
 
     def __init__(self, grid):
-        """Build a Sudoku problem from a string representing the grid: the digits
-        1-9 denote a filled cell, '.' or '0' an empty one; other characters are
-        ignored."""
+        """Build a Sudoku problem from a string representing the grid:
+        the digits 1-9 denote a filled cell, '.' or '0' an empty one;
+        other characters are ignored."""
         squares = iter(re.findall(r'\d|\.', grid))
         domains = dict((var, [int(ch)] if ch in '123456789' else range(1, 10))
                        for var, ch in zip(flatten(self.rows), squares))
diff --git a/games.py b/games.py
@@ -105,7 +105,7 @@ def min_value(state, alpha, beta, depth):
                    (lambda state,depth: depth>d or game.terminal_test(state)))
     eval_fn = eval_fn or (lambda state: game.utility(state, player))
     action, state = argmax(game.successors(state),
-                           lambda ((a, s)): min_value(s, -infinity, infinity, 0))
+                           lambda (a, s): min_value(s, -infinity, infinity, 0))
     return action
 
 #______________________________________________________________________________
diff --git a/learning.py b/learning.py
@@ -372,8 +372,8 @@ def decision_list_learning(self, examples):
         return [(t, o)] + self.decision_list_learning(examples - examples_t)
 
     def find_examples(self, examples):
-        """Find a set of examples that all have the same outcome under some test.
-        Return a tuple of the test, outcome, and examples."""
+        """Find a set of examples that all have the same outcome under
+        some test. Return a tuple of the test, outcome, and examples."""
         NotImplemented
 #______________________________________________________________________________
 
diff --git a/utils.py b/utils.py
@@ -710,7 +710,8 @@ def pop(self):
             return self.A.pop()[1]
 
 ## Fig: The idea is we can define things like Fig[3,10] later.
-## Alas, it is Fig[3,10] not Fig[3.10], because that would be the same as Fig[3.1]
+## Alas, it is Fig[3,10] not Fig[3.10], because that would be the same
+## as Fig[3.1]
 Fig = {} 
 
 #______________________________________________________________________________
