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


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█
█ ███ █████       █.███.█████
█   █     █   →   █...█.....█
███ █████ █       ███.█████.█
█         █       █  .......█
███████████       ███████████
0 characters
Compiled from AT&T syntax to x86-64 Linux. Use syscalls to write output. For accurate byte counts and syntax highlighting, please use the new editor.
Top-level programs are supported, args holds ARGV.
ARGV is available via STDIN, joined on NULL. x is a no-op.
ARGV is available via STDIN, joined on NULL.
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.
ctrl + enter or Run