Maze solving: Difference between revisions
→{{header|EasyLang}}
Line 1,444:
len m[] n * n
#
func show_maze . .
clear
for i range len m[]
if m[i] = 0
x = i mod n
y = i div n
.
.
Line 1,496:
x = pos mod n
y = pos div n
.
func solve dir0 pos . found .
| |||