Data update

Task/Maze-solving/EasyLang/maze-solving.easy

@@ -3,22 +3,23 @@ n = 2 * size + 1
 f = 100 / (n - 0.5)
 len m[] n * n
 #
-background 000
-proc show_maze . .
-   clear
+gbackground 000
+proc show_maze .
+   gclear
+   sz = f * 1.5
+   f2 = f / 2
    for i = 1 to len m[]
       if m[i] = 0
          x = (i - 1) mod n
          y = (i - 1) div n
-         color 999
-         move x * f - f / 2 y * f - f / 2
-         rect f * 1.5 f * 1.5
+         gcolor 999
+         grect x * f - f2 y * f - f2 sz sz
       .
    .
    sleep 0.01
 .
 offs[] = [ 1 n -1 (-n) ]
-proc m_maze pos . .
+proc m_maze pos .
    m[pos] = 0
    show_maze
    d[] = [ 1 2 3 4 ]
@@ -33,7 +34,7 @@ proc m_maze pos . .
    .
 .
 endpos = n * n - 1
-proc make_maze . .
+proc make_maze .
    for i = 1 to len m[]
       m[i] = 1
    .
@@ -50,18 +51,15 @@ proc make_maze . .
 make_maze
 show_maze
 #
-proc mark pos col . .
+proc mark pos col .
    x = (pos - 1) mod n
    y = (pos - 1) div n
-   color col
-   move x * f + f / 4 y * f + f / 4
-   circle f / 3.5
+   gcolor col
+   gcircle x * f + f / 4 y * f + f / 4 f / 3.5
 .
-global found .
-proc solve dir0 pos . .
-   if found = 1
-      return
-   .
+found = 0
+proc solve dir0 pos .
+   if found = 1 : return
    mark pos 900
    sleep 0.05
    if pos = endpos