Data commit

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

@@ -0,0 +1,81 @@
+size = 15
+n = 2 * size + 1
+f = 100 / (n - 0.5)
+len m[] n * n
+#
+background 000
+proc show_maze . .
+   clear
+   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
+      .
+   .
+   sleep 0.01
+.
+offs[] = [ 1 n -1 (-n) ]
+proc m_maze pos . .
+   m[pos] = 0
+   call show_maze
+   d[] = [ 1 2 3 4 ]
+   for i = 4 downto 1
+      d = random i
+      dir = offs[d[d]]
+      d[d] = d[i]
+      if m[pos + dir] = 1 and m[pos + 2 * dir] = 1
+         m[pos + dir] = 0
+         call m_maze pos + 2 * dir
+      .
+   .
+.
+endpos = n * n - 1
+proc make_maze . .
+   for i = 1 to len m[]
+      m[i] = 1
+   .
+   for i = 1 to n
+      m[i] = 2
+      m[n * i] = 2
+      m[n * i - n + 1] = 2
+      m[n * n - n + i] = 2
+   .
+   h = 2 * random 15 - n + n * 2 * random 15
+   call m_maze h
+   m[endpos] = 0
+.
+call make_maze
+call show_maze
+#
+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
+.
+proc solve dir0 pos . found .
+   call mark pos 900
+   sleep 0.05
+   if pos = endpos
+      found = 1
+      break 1
+   .
+   of = random 4 - 1
+   for h = 1 to 4
+      dir = (h + of) mod1 4
+      posn = pos + offs[dir]
+      if dir <> dir0 and m[posn] = 0 and found = 0
+         call solve (dir + 1) mod 4 + 1 posn found
+         if found = 0
+            call mark posn 888
+            sleep 0.08
+         .
+      .
+   .
+.
+sleep 1
+call solve 0 n + 2 found