Maze
Details
For a given maze, find the shortest path from Start to End points. Output the path in the maze with dots. For example:
########### ########### #S# E# #S# ....E# # ### ##### #.###.##### # # # → #...#.....# ### ##### # ###.#####.# # # # .......# ########### ###########
0 bytes, 0 chars
Restore solutionCompiled from
AT&T syntax to x86-64 Linux. Use
syscalls to write output.
Arturo is an experimental language, no solutions will be saved.
Please leave feedback on the
GitHub issue.
Fennel is an experimental language, no solutions will be saved.
Please leave feedback on the
GitHub issue.
Uiua is an experimental language, no solutions will be saved.
Please leave feedback on the
GitHub issue.
ctrl + enter or