Application 2553

posted by MikeynJerry on Sat, 2012-09-01 22:22
In-game name: 
MikeynJerry
Age (Optional): 
14
Why are you interested in joining this server?: 
Because the RDF is getting old, and I would like to see some new faces emerge from the redstone scene. Also because there are very few dedicated redstone servers and this one seems the best from an outside view.
Past Redstone Experience: 
I've built almost everything possible/imaginable; Space Invaders, 32-bit Double Dabble decoder; 64-bit computer, etc.
Application status: 
Not approved

Comments

Flandyn's picture

On Sat, 2012-09-01 22:32

If you got into the RDF then you would know that you are supposed to write more :P

By Flandyn

On Sat, 2012-09-01 22:53

I would go on to explain the computer or Space Invaders in thorough detail, but I don't have all day. Anyway, I'll explain the Double Dabble decoder:

Double Dabble decoder- A machine that runs the Double Dabble algorithm like so:
You start with
10^4 10^3 10^2 10^1 10^0 ORIGINAL BINARY
0000 0000 0000 0000 0000 1111111011011100 Initialization
0000 0000 0000 0000 0001 1111110110111000 Shift left (1st)
0000 0000 0000 0000 0011 1111101101110000 Shift left (2nd)
0000 0000 0000 0000 0111 1111011011100000 Shift left (3rd)
0000 0000 0000 0000 1010 1111011011100000 Add 3 to 100, since it was 7
0000 0000 0000 0001 0101 1110110111000000 Shift left (4th)
0000 0000 0000 0001 1000 1110110111000000 Add 3 to 100, since it was 5
0000 0000 0000 0011 0001 1101101110000000 Shift left (5th)
0000 0000 0000 0110 0011 1011011100000000 Shift left (6th)
0000 0000 0000 1001 0011 1011011100000000 Add 3 to 101, since it was 6
0000 0000 0001 0010 0111 0110111000000000 Shift left (7th)
0000 0000 0001 0010 1010 0110111000000000 Add 3 to 100, since it was 7
0000 0000 0010 0101 0100 1101110000000000 Shift left (8th)
0000 0000 0010 1000 0100 1101110000000000 Add 3 to 101, since it was 5
0000 0000 0101 0000 1001 1011100000000000 Shift left (9th)
0000 0000 1000 0000 1001 1011100000000000 Add 3 to 102, since it was 5
0000 0000 1000 0000 1100 1011100000000000 Add 3 to 100, since it was 9
0000 0001 0000 0001 1001 0111000000000000 Shift left (10th)
0000 0001 0000 0001 1100 0111000000000000 Add 3 to 100, since it was 9
0000 0010 0000 0011 1000 1110000000000000 Shift left (11th)
0000 0010 0000 0011 1011 1110000000000000 Add 3 to 100, since it was 8
0000 0100 0000 0111 0111 1100000000000000 Shift left (12th)
0000 0100 0000 1010 0111 1100000000000000 Add 3 to 101, since it was 7
0000 0100 0000 1010 1010 1100000000000000 Add 3 to 100, since it was 7
0000 1000 0001 0101 0101 1000000000000000 Shift left (13th)
0000 1011 0001 0101 0101 1000000000000000 Add 3 to 103, since it was 8
0000 1011 0001 1000 0101 1000000000000000 Add 3 to 101, since it was 5
0000 1011 0001 1000 1000 1000000000000000 Add 3 to 100, since it was 5
0001 0110 0011 0001 0001 0000000000000000 Shift left (14th)
0001 1001 0011 0001 0001 0000000000000000 Add 3 to 103, since it was 6
0011 0010 0110 0010 0010 0000000000000000 Shift left (15th)
0011 0010 1001 0010 0010 0000000000000000 Add 3 to 102, since it was 6
0110 0101 0010 0100 0100 0000000000000000 Shift left (16th)
6 5 2 4 4
BCD

The way the machine works is that it takes any binary number, shifts it then checks if it's above 4. If it is then it adds 3, if it isn't, it shifts again and so on.

This is what I built for the application: http://imgur.com/a/H8bRd

Reply to above comment:
I actually got into the RDF before you had to write applications. I made a seven segment display as my ticket in, but it was about a year ago.

By MikeynJerry