Application 7662

I invented a melon farm on the survival server, it consisted of 20 stacks of pistons, and yeilded 45 melon stacks, and 16 pumpking stacks per hour (2 pistons per crop). I had a clock that ran every 2 minutes, at which point a redstone signal was sent out to all the pistons (purposely added time delays to avoid severe lag), the dirt under the pistons was retracted by a sticky piston, then a piston above the crop would crush it from above; the crop then fell into an irrigation system below. *I've invented many doors & cool displays, this involved timing, double pistons, rapid clocks that turn on/off on command, timers, spam proofing ect. *I invented a means to harness the time delay of hoppers. so after you press a button, a secondary pulse can be sent between 11 seconds and 8 minutes (time it takes to move 23 items or 10 stacks worth through hoppers) This invention I already made in the visitors plot. *I've invented a means to convert a single digit base 10 number into binary at the visitors plot. This was acheived not through a basic bus attatched to torches to light up the different bits, but a more intricate method to practice my use of enablers and if statements (the enablers to use else if statements) . if(# >= 8){light up left bit, subtract 8 from x, if(# >= 1){light up right bit, subtract 1 from x} } else if(# >= 4){ light up mid-left bit, subtract 4 from x, if(# >= 2){light up mid-right bit, subtract 2 from x}if(# >= 1) {light up right bit, subtract 1 from x} } else if(# >= 2){light up mid-right bit, subtract 2 from x, if(x >= 1){light up right bit, subtract 1 from x} } else{light up right bit} System.exit(0); *I now have an understanding of how a rippler adder functions; it separates the bits of each number, and adds them like you would add base 10 numbers on paper, using carry over numbers. for the first digits, if the sum = 1, the sum's first digit will = 1. It tests this using an xor gate, however when both digits that you're adding are 1, then that number goes over the base 2, so it carries over. So when you add the digits of the 2nd bit, it will add 1 to the equation, leaving a possible sum of 1, 2, or 3. if the sum is 1, it will just turn on the sum's 2nd bit light, if the sum is 2, it will carry over to the next adder, if the sum is 3, it will turn on the sum's second bit light and carry 1 over to the next adder. This is done by having an xor gate testing both digits, if one of them is on, it will send that signal into another xor gate, with the 2nd input being the carry in wire from the previous adder, so if one of those is on, the xor gate will pass the signal, turning the 2nd bit light on (this means that the sum of the 2 digits and the carry in is either = 3 or 1, in either case the light in bit 2 will turn on) . the initial xor output, and the carry in wire also go to an and switch, in which case both are on, the 2nd bit light wont light, and the carry over wire will send a signal to the next adder. Also, next to the initial xor gate is an and gate, with inputs of the 2nd bit digits, if both are on, then it sends a signal to the carry out wire. Note on how xor gates work: xor aka: exclusive or gates, allow for 2 inputs. If either input is on, it will output a signal, if neither or both are on, it wont output a signal. this can be made using a nand gate, an or gate, and an and gate. both inputs are fed side by side through an or gate and a nand gate. the output of the nand and or gate are fed into an and gate. The output is xor. If both inputs are on, the nand gate will shut off it's power to the and gate, but if only one input is on, the nand gate and or gate will power the and gate. if neither input is on, the or gate is off, causing the boolean of the and gate to be false.