diff --git a/README.md b/README.md
index 50e0df49e70e714268d17d2818e15e6d8ca9fdbb..bed7fe619821234f009995b42f7bd88699879308 100644
--- a/README.md
+++ b/README.md
@@ -144,6 +144,16 @@
 - ![matrix](journal_media/matrix_to_img.png)
 
 - TODO:
-  - Write out algorithm for muli-node path finding 
+  - Write out algorithm for multi-node path finding 
   - break single circuit trace to parallel traces
-  - solve the accuracy problem
\ No newline at end of file
+  - solve the accuracy problem
+
+### 07/04/2019 (Fri)
+- Write out algorithm for multi-node path finding 
+  - pseudo code:
+  >  for (episode in E):
+  > >   set initial state s (choose first pair of nodes to connect randomly)
+  > >   while max steps per episode not reached:
+  > > > 
+  > 
+- Research on KiCAD import needs and python API
\ No newline at end of file
diff --git a/silhouette_ele.dxf b/silhouette_ele.dxf
index 973041b6ce8558f5662e592fa34b84daed0d9e3c..10f593b4c879b482688716bfd3a077da8300c477 100644
--- a/silhouette_ele.dxf
+++ b/silhouette_ele.dxf
@@ -53,7 +53,7 @@ $HANDLING
   9
 $TDUPDATE
  40
-2458668.95997
+2458670.51344
   9
 $HANDSEED
   5