Maze solving: Difference between revisions
m
→{{header|EasyLang}}
Line 1,473:
.
endpos = n * n - 1
proc make_maze . .
for i = 1 to len m[]
Line 1,484 ⟶ 1,483:
m[n * n - n + i] = 2
.
h = 2 * random 15 - n + n * 2 * random 15
call m_maze
m[endpos] = 0
endpos += n
Line 1,511:
call solve (dir + 1) mod 4 + 1 posn found
if found = 0
call mark posn
sleep 0.08
.
Line 1,518:
.
sleep 1
call solve 0
</syntaxhighlight>
| |||