#17 Split simplify.py from solver.py.

dynamic.pyx

@@ -1,5 +1,4 @@
 # distutils: language=c++
-#### distutils: sources=search.cpp
 from libcpp cimport bool
 from libcpp.unordered_set cimport unordered_set
 from libcpp.vector cimport vector

simplify.py

@@ -0,0 +1,45 @@
+#!/usr/local/bin/python3
+"""
+Eliminate tracks which can be contructed from already present tracks.
+
+e.g. RRRRSRRRRS, RRRRRRRR -> RRRRRRRR
+"""
+
+import argparse
+import sys
+
+import track
+
+
+DESCRIPTION = """\
+Take tracks from standard input and print the ones which can be used to
+construct the whole set.
+
+Each track should be provided on a new line.
+
+Algorithm for extension:
+Extend round track in the opposite direction with S, RL, LR.
+Prolong bridges. Replace uphill, downhill with straight segments.
+"""
+
+
+def can_be_simplified(t, set_of_tracks):
+    return any(st in set_of_tracks for st in t.simplify())
+
+
+def main():
+    # TODO: algorithm expects that the shorten piece is also present in the set.
+    # remove this condition.
+    parser = argparse.ArgumentParser(description=DESCRIPTION)
+    args = parser.parse_args()
+    tracks = set()
+    for line in sys.stdin:
+        path = line.strip()
+        tracks.add(track.Track(path).normalize())
+    tracks = [t for t in tracks if not can_be_simplified(t, tracks)]
+    for t in tracks:
+        print(t.path)
+
+
+if __name__ == '__main__':
+    main()

solver.py

@@ -11,10 +11,6 @@
     'Material', 'straight turns ups, downs pillars')
 
 
-def can_be_simplified(t, set_of_tracks):
-    return any(st in set_of_tracks for st in t.simplify())
-
-
 def normalize_paths(paths):
     filtered = []
     paths = set(paths)
@@ -34,8 +30,6 @@ def compute_tracks(material):
     paths = normalize_paths(paths)
     tracks = [track.Track(p) for p in paths]
     tracks = [t for t in tracks if t.is_valid(material)]
-    set_of_tracks = set(tracks)
-    tracks = [t for t in tracks if not can_be_simplified(t, set_of_tracks)]
     return tracks