Rem  Euclids
Rem  Finds the highest common factor of two numbers
Rem  using a variation of Euclids algorithm

Turing
0,0;0,0,R
0,1;1,1,L
1,0;2,1,R
1,1;1,1,L
2,0;10,0,R
2,1;3,0,R
3,0;4,0,R
3,1;3,1,R
4,0;4,0,R
4,1;5,0,R
5,0;7,0,L
5,1;6,1,L
6,0;6,0,L
6,1;1,1,L
7,0;7,0,L
7,1;8,1,L
8,0;9,0,L
8,1;8,1,L
9,0;2,0,R
9,1;1,1,L
10,0;0,0,S
10,1;10,1,R

Tape
0000001111110111111111100000000000
Rem  With this tape, the highest common factor of
Rem  six and ten will be calculated

End