Interesting solution for counting signals. I saw a different solution that was a bit simpler. It accounted for even or odd on the top pin, if it was 2 or 3 for the middle pin, and if it was 4 for the bottom pin. Still, it's always good to see different solutions! Also, thanks for the information about k maps!
if it's odd it's top pin (XOR), if it's 2 or more it's 2nd pin (double trouble), if it's odd AND 2 or more it's the third pin (top pin does not need to change). these conditions can all run independently and do not need to account for eachother. only exception you need to make is if all 4 inputs are on but that's simple enough with a nand
So, how hard did you facepalm when editing? Because I suspect you didn't look at the truth table once when solving the "bit inverter", including after it was revealed that you created an xor gate. And in case you missed it during editing, the xor gate was available in the component list the entire time.
My weakness was the upcoming byte adder level it took me literally 3 hours cause i over engineered these massive contraptions the first two tries. I related to how you were feeling on that last level so much
On the section with the binary counter, you should have taken the expected inputs & outputs and generated a Karnaugh Map with them then use the rules of Boolean Algebra such as the Product of Sums and Sums of Products and the basic Laws of Boolean Algebra to simplify the Logical Expression to its minimal number of terms. Then you would have known exactly how many and which logical components you would have needed to build the circuit. For example: anything ANDed with 0 is Always 0. Anything ORed with 1 is always 1 and so on. Truth Tables, Gray Codes, Karnaugh Maps and Implication Tables can be your best friend in reducing logical circuit complexities. *Edit* I noticed you mentioned exactly this at the end of your video stream. But yes, for anyone who is interested in logical circuit design: Truth Tables, Gray Codes, Karnaugh Maps, Implications Tables, and basic knowledge of Boolean Algebra are you best friends.
as someone that went into this game with no circuitry knowledge whatsoever, I love this video. thank you!
The "bit inverter" can do with just a xor module in case you didn't know it 😅 btw with just 7 "and" 4 "xor" and 3 "or " u do the "counting signals"
i was screaming at my screen when he didn't use an xor
Interesting solution for counting signals. I saw a different solution that was a bit simpler. It accounted for even or odd on the top pin, if it was 2 or 3 for the middle pin, and if it was 4 for the bottom pin. Still, it's always good to see different solutions!
Also, thanks for the information about k maps!
if it's odd it's top pin (XOR), if it's 2 or more it's 2nd pin (double trouble), if it's odd AND 2 or more it's the third pin (top pin does not need to change). these conditions can all run independently and do not need to account for eachother. only exception you need to make is if all 4 inputs are on but that's simple enough with a nand
mine was implementing the truth table. Not to fancy but worked. Now I will spend a few days to understand how to optimize it.
So, how hard did you facepalm when editing? Because I suspect you didn't look at the truth table once when solving the "bit inverter", including after it was revealed that you created an xor gate. And in case you missed it during editing, the xor gate was available in the component list the entire time.
Definitely had several facepalm moments and even went back to re-record certain segments where I had over-engineered crazy solutions
My weakness was the upcoming byte adder level it took me literally 3 hours cause i over engineered these massive contraptions the first two tries. I related to how you were feeling on that last level so much
wait til you get to less than bytes. hardest level in the game for me so far
I'm on the last level before the Turing Machine one, and I have no idea on what to do.
Watching this and comparing to my playthrough to see if i overcomplicated things lol
On the section with the binary counter, you should have taken the expected inputs & outputs and generated a Karnaugh Map with them then use the rules of Boolean Algebra such as the Product of Sums and Sums of Products and the basic Laws of Boolean Algebra to simplify the Logical Expression to its minimal number of terms. Then you would have known exactly how many and which logical components you would have needed to build the circuit. For example: anything ANDed with 0 is Always 0. Anything ORed with 1 is always 1 and so on. Truth Tables, Gray Codes, Karnaugh Maps and Implication Tables can be your best friend in reducing logical circuit complexities.
*Edit*
I noticed you mentioned exactly this at the end of your video stream.
But yes, for anyone who is interested in logical circuit design: Truth Tables, Gray Codes, Karnaugh Maps, Implications Tables, and basic knowledge of Boolean Algebra are you best friends.
Don't get eaten by your final semester exam.