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

Turtle

Details

Given a single argument containing multiple lines of space-separated instructions containing distance and direction (N, E, S, or W).

You must move the turtle 🐢 <(U+1F422) corespondingly from the start 🏁 (U+1F3C1) and draw a path using ⬜ (U+2B1C) filing the empty squares with 🟩 (U+1F7E9)

Example:

Input:

5 N
3 W
2 S
7 E
Output:
⬜⬜⬜⬜🟩🟩🟩🟩
⬜🟩🟩⬜🟩🟩🟩🟩
⬜⬜⬜⬜⬜⬜⬜🐢
🟩🟩🟩⬜🟩🟩🟩🟩
🟩🟩🟩⬜🟩🟩🟩🟩
🟩🟩🟩🏁🟩🟩🟩🟩

The turtle starts at the flag and moves 5 units north, 3 units west, 2 units south, and 7 units east, intersecting the previous path. Keep in mind if the turtle ends up at the beginning, print the turtle but not the flag

0 bytes, 0 chars
Restore solution
All
Compiled from AT&T syntax to x86-64 Linux. Use syscalls to write output.
ctrl + enter or

Delete Solution

Are you sure you want to delete your solution(s) for Turtle?

If you have seperate bytes and chars solutions then both will be deleted.

This is irreversible, please backup any code you care about.

Type I understand and press confirm to continue.