Euclidian Algorithm Piet Implementation

[ThijsRay]

Euclidian algorithm in Piet

I would argue that text books can be better understood if they contain pictures. Piet is an excellent programming language that achieves this goal.

This pull request aims to implement the Euclidian Algorithm in Piet.

To run Piet programs, I would advice npiet. The -t and -tps parameters are especially useful because they show exactly what path the program is taking.

Euclidian algorithm with the modulo operator

Actual version:
Enlarged version for better visibility:
This version is quite small because it takes only a few commands to do the euclidian algorithm with the modulo operator. Possibly the smallest implementation of the euclidian algorithm in Piet yet.

Euclidian algorithm with subtraction

Actual version:
Enlarged version for better visibility:
This version is a lot bigger than the previous one, because of a few reasons:

• Taking an absolute value in Piet takes a lot of commands.
• The stack has to be modified a lot to make the algorithm work.
• There are a lot of branches.

I added some extra colourful pixels to fill up the empty space I was left with.

Reviewing these pixels

The pixels are based on the implementation that can be found in euclidian_algorithm.piet. This can be manually verified with npiet -t [program].

[leios]

This looks really cool. I'll try to learn it and do a review when I can and when it's completed.

[Liikt]

Everything looks good so far. Three questions though:

1. Is there a specific reason you started with a different color?
2. How did you manage to limit the Color Blocks of the As in the sub euclid to onl 4? did you change the color slightly?
3. Have you gone crazy? :D

[ThijsRay]

@Liikt

1. There is no reason for that. I just chose a random starting colour.
2. I changed the colour slightly. The colour blocks that count are of the colour #00ffff. The colour of the A's is #00fffe.
3. Not yet!

[Liikt]

Aight. This is crazy enough and it works