This hole is experimental, no solutions will be saved. Please leave feedback on the GitHub issue.

Maze

Details

For each input maze, find the shortest path from Start to End points. Output the path in the maze with dots. For example:

███████████       ███████████
█S█      E█       █S█  ....E█
█ ███ █████       █.███.█████
█   █     █   →   █...█.....█
███ █████ █       ███.█████.█
█         █       █  .......█
███████████       ███████████
All
Compiled from AT&T syntax to x86-64 Linux. Use syscalls to write output.
Top-level programs are supported, args holds ARGV.
Arguments are available via STDIN, each argument is NULL terminated. Taking input after EOF leaves the cell unchanged, the tape is circular with 65536 cells, and cells are 8-bit with wrapping.
Arguments are available via STDIN, each argument is NULL terminated. x is a no-op.
Arguments are available via STDIN, each argument is NULL terminated.
arguments holds ARGV, print() to output with a newline, write() to output without a newline.
say() is available without any import.
$args to access the arguments.
SELECT arg FROM argv to access the arguments, only the first column of the first result set will be printed, NULL values will be skipped, and the dialect is SQLite.
Arguments are available via args list variable. To terminate script execution, write and quit the current buffer.
ctrl + enter or Run