9
$\begingroup$

The goal of this puzzle is to find a sequence of max 5 commands that will move the triangle through the maze and visit all colored squares.

Three types of commands can be used:

  • F0 makes the sequence start over.
  • The arrows (↑, ↱, ↰) move the triangle (forward) or make it change orientation (clockwise, anti-clockwise).
  • Xs change the color of the square the triangle is in to the color of the X.

Each command can (but does not need to) have a color. A colored command is only executed if the triangle is in a square of the same color.

Demonstration of the mechanics and example puzzles here.

Disclaimer: I am one of the developers of the site.

A programming puzzle without code

$\endgroup$
  • $\begingroup$ We are not allowed to visit gray square, cmiiw? $\endgroup$ – athin Jun 14 at 11:46
  • $\begingroup$ @athin only blue, green, and red squares can be visited. Attempting to visit a grey square is not allowed. $\endgroup$ – Lucas Jun 14 at 12:09
  • $\begingroup$ Nice puzzle concept. If you are affiliated with the site in question, please (take some credit! and) let us know that :) $\endgroup$ – Rubio Jun 15 at 6:59
7
$\begingroup$

Lets try it in natural language

Start: Turn right, Forward, Turn left if blue, Forward, restart

or abbreviated

F0: R, F, L(blue), F, F0

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.