🦊
Can one algorithm solve an entire maze? Let's find out! - Put "if path ahead { forward } else { turn right }" inside a repeat(15).
Your explorer:
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
⭐
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🧱
🦊
🧰 Blocks - click to add
Your Code
0 / 6
💡 You need 3 blocks - add 3 more!
↑
Click the blocks above to build your code!