I Built an INSANE Logic Puzzle to Troll my Friends!

Those logic gates present multiple solutions to your puzzle. 4 to be exact when I have Logisim analyze it. Are you sure that your actual implementation only has one solution?

Your circuit diagram is ambiguous. Usually people use the little half circle to indicate which traces don't connect any time its remotely unclear. The whole xor -> and gate section is nonstandard to the point where no one can read it since you have paths that go right, down, right, then back up then right. You're using no rule set that exists in electrical engineering. This is somewhere between the abstraction of a netlist and the concrete traces of an actual lithography.

The easiest right way to do it would be to have added circles at every crossing you intended to be a connection.

Kan made a legitimately unsolvable puzzle and really said “All you gotta do is solve the puzzle” 😂😂😂

It is very hard to follow when all the wired are on top of eachother at the end there

What car is that. Looks like an fc rx7. It's sick. How'd you get it?

I dont think i could get this even if i just looked at the answer for 10 minutes

As someone who is becoming an electrian Iaprove this lmfao. Next time make one using all the "controversial* simbols or the symbols that require interepratation like irl sometimes

Engineer 101 : HOW TO GET YOUR ENGINEER DEGREE REVOKED.

This is insane.
This is what an insane person creates.

You say the puzzle is simple, but it looks pretty (NP) hard to me

(explanation of the solution at the bottom)
I got nerd sniped and spent a half an hour on this. There are 4 possible correct answers:

0123456789
TFFTTTTFFT
TFFTTFTFFT
FTTFFTFTTF
FTTFFFFTTF

Note that there are 2^10 possible inputs and each output can reduce the solution space by at most half, so there are guaranteed to be at least 4 solutions, which the circuit does gets down to.

There is also a layer of xor gates, which do not change their output if both inputs change, so if you find one solution, if you invert everything, you will get another solution.

------------------------------------
How I found the solution:

First notice the the circuit is well structured (some inputs, a layer of wires, some xor gates, a layer of wires, some and gates and nand gates, then the outputs)

I solved from the end backward.

First notice that because inverting the output and turning a nand into an and are the same, what we need is for the first 2 and gates to be 1 and the rest to be 0.

For this, find the 6 xor gates that lead into the first 2 and gates and mark then ask as outputting 1. These are xor gates 2, 3, 5, 7, 8, and 10.

I looked through the remaining and/ and gates and found that output 8 (the last one) almost has a problem. There needs to be a 0 input, and the only option is xor 9, so that needs to be 0.

With that in place we are guaranteed to also give the necessary 0s to outputs 4, 5, and 7.

This leaves only outputs 3 and 6 unaccounted for. When we analyze these, we find that output 3 needs 1 of xor gates 1 or 4 to be 0, and that output 6 needs 1 of xor gates 1 or 6 to be 0.

------------------------------------
Finding the inputs:
We know from the above analysis that we need the outputs of xor gates 2, 3, 5, 7, 8, and 10 to be 1. We need xor gate 9 to be 0, and we need either xor 1 or xors 4 and 6 to be 0.

First we analyze the gates whose values are known.

Example analysis of xor gate 2:
we need a 1 out of this gate. This gate has inputs of (not 0) and 3. If these are not equal, the result will be the 1 we need, this means that we need input 0 to be the same as input 3.

If we do similar logic to the remaining xor gates whose values are known (notice that's for xor 9 we need the inputs to be the same) we get the following constraints

0 = 3
1 = 2 = 7 = 8 ≠ 4 = 6 = 9
5 can be anything

We then add in the constraints for case 1: (xor 1 outputs 0 which means that input 0 ≠ input 2) we find 0 = 3 = 4 = 6 = 9 ≠ 1 = 2 = 7 = 8 and 5 can be anything.

For completeness, case 2: (xor 4 and xor 6 both output 0 means 1 = 5 ≠ 3) yields 0 = 3 = 4 = 6 = 9 ≠ 1 = 2 = 5 = 7 = 8, which is already covered by case 1. (During my analysis I did not realize that case 2 was covered in case 1 and thought for a while there were 6 answers)

Turning the constraints above into a table gives the table at the top of the answer.

Not sure how kAN got RLRRLRLLLR to work...
I built this circuit in Turing Complete and got the following solutions:
RLLRRRRLLR
RLLRRLRLLR
LRRLLRLRRL and:
LRRLLLLRRL
The observant will note that these are just the first two and then their binary opposites.

(!8 xor 1) and (6 xor !4) and (7 xor 9) and (!0 xor 3) and (2 xor 4) and (!6 xor !7) and !((0 xor !2) and (5 xor !3) and (7 xor 9)) and (!5 xor !1) and (2 xor 4) and (8 xor !9) and !((5 xor !3) and (!8 xor 1) and (8 xor !9)) and (0 xor !2) and (!5 xor !1) and (!6 xor !7) and (!0 xor 3) and (8 xor !9) and (5 xor !3) and !((!6 xor !7) and (8 xor !9) and (7 xor 9))

Seems easy enough.

"oh yeah that's a AND gate and that's a XOR gate and..." Bruh. Those were random shapes to my brain this late xD. I'm used to like == and != and || from my time in uscript coding, but I was completely clueless with these symbols lmao. Also that snipe at the end, I'm still calling hax >:|

Bet upfront: On: 456 9
Ok it was totally wrong but I'm so incredibly sure... maybe I got confused by the overlaying connections?

Idea: Revamp your fast flipping speed tracks with logic.
-Whether that be: time gating, route changing, or even trigger based checkpoints that unlock the final straightaway/jump?. Maybe all.

you can just solve some and gates and the rest trial and error. still and i don't have the patients to do so

Working it out the set of possible solution collapses to 2, because of your usage of XOR gates, which results in having 2 categories of numbers and the only way to know which category is on and the other off is to just test the track

So no scrap mechanic multiplayer Monday

prefacing this with the assumption that can I read all the connections from the XORs to the ANDs/NANDs correctly (which is a big if):

1st and 2nd lights have to be on; so their corresponding AND gates have to output TRUE; so the 3rd, 7th, 10th, 2nd, 5th, and 8th XOR gates all have to output TRUE.
8th light has to be on; so its NAND gate has to output TRUE; and since the 8th and 10th XOR gates output TRUE; the 9th XOR gate has to output FALSE.
9th XOR gate outputs FALSE; means the 4th and 7th light will be off, and the 5th light will be on regardless of the other XOR gates.
3rd light has to be on; so its NAND gate has to output TRUE; and since the 10th XOR gate outputs TRUE; either the 1st or 4th XOR gate has to output FALSE.
6th light has to be off; so its AND gate has to output FALSE; and since the 7th XOR gate outputs TRUE; either the 1st or 6th XOR gate has to output FALSE.

for the 3rd XOR gate to output TRUE; 1 and 8 have to be the same
for the 7th XOR gate to output TRUE; 4 and 6 have to be the same
for the 10th XOR gate to output TRUE; 7 and 9 have to be opposite
for the 2nd XOR gate to output TRUE; 0 and 3 have to be the same
for the 5th XOR gate to output TRUE; 2 and 4 have to be opposite
for the 8th XOR gate to output TRUE; 6 and 7 have to be opposite
for the 9th XOR gate to output FALSE; 8 and 9 have to be opposite
altogether so far: 1, 2, 8, and 7 have to be one number; while 9, 6, and 4 have to be the other number

for the 1st XOR gate to output FALSE; 0 and 2 have to be opposite
which means 0 and 3 also have to be the same number as 9, 6, and 4

for the 4th XOR gate to output FALSE; 3 and 5 have to be the same
for the 6th XOR gate to output FALSE; 1 and 5 have to be opposite
which means 0, 3, and 5 also have to be the same number as 9, 6, and 4

in conclusion: 1, 2, 8, and 7 are one group; 0, 3, 4, 6, and 9 are the other group. but because all of them input into XOR gates and only XOR gates, it doesn't actually matter which group is 0 and which group is 1, as long as the two groups have different numbers. while 5 can be either number and has no effect on the final answer as long as the other 9 are correct. so you have a total of 4 different possible answers to the diagram of your logic puzzle

The code is workable, but the post XOR wires are a crime.

next time on KANpkist we use logic to create a Quiz show with questions about the game and if you get every question right you win a prize of not crashing and dying but actually finishing the level!

build a track where you drive against a wall if you are over a certain speed limit

kAN I see what you were going for, I think. You wanted to have the output signal a shortcut hint. Solution been the inverse arrangement of it. But the solution for those logic gates are different: it been 1001101001 or the inverse. I also checked the comments section and found an another explanation; it said that the number 5 can be any number. So all together there are 4 solution for the diagram. I also double checked the solutions from them using excel. Maybe the diagram was wrong?

The logic diagram reminds me of the time I've spent looking over motorcycle wiring diagrams - none of the logic gates, of course, but all black lines with letter codes indicating the wire color, a lot of which are a base color and a stripe color

Bro made a track so undesirably confusing his friends leave and return to do a double take

I tried recreating the schematic and got the result 12578 instead of 14678, I ain't debugging this

Multi color kan

I work with such gate diagrams weekly and if one of my colleagues gave me this diagram I would straight ask them if they are joking and laugh in their face regardless. Without any bridges/dots for the signal connections (wires) this may be the worst diagram I have ever frikandel seen.

How about A Zeepkist! Map where you build an elaborate map of hidden paths that are visible from above using a Paraglider. however using the Paraglider makes completing the map impossible.
So you have to run the map as a Soapbox car, but the Glider gives you the correct path.
And maybe a secret message to the players?

I think you could do something really cool like your Logic Circuit track, but visible only from above with a Paraglider.

I think there are actually multiple solutions no? like 0110000110 should work too?

I do computer science a level and I noped out of this

Let’s gooooooooooooooooooooooooooooooooooooooooooooooooooooooooo

Kan you broke my brain watching this
-mj

Kan is such a dingus, his advice is work backwards as a rule of thumb, but then just says "haha the whole right side is basically irrelevant", so thanks for the bad advice I guess

i have been tracing for a whille now, colour coding, checking which xor gates have to be true, can't get it, and i tried inputting the true stated and gave me 10001001 as the out, i cannot for the life of me get this right

1 4 5?

i did not got this

My brain doesnt do logic normally, nevermind it being past midnight! D:

This comment is a spleef idea! The spud guns are 3 long but having them 2 wide would solve the missing connection point problem, so you wouldn't have to exit your vehicle and shoot at them with a handheld spudgun

as someone who's an electrician, that's illegible. you're supposed to do like little humps when wires cross each others.

I'm just gonna say it. If anyone gives me this schematic, I will have them fired. You have to keep your scematics clean and organized.

Whatever happened to warcans?

Honestly i couldn't follow the third part because the scale size made it much harder to read because there isn't enough spacing. Ive had this problem reading these kind of logic gates. I prefer psuedo coding. But in diagrams the more complex it gets the hatder its to read not because the logic but its much easier for lines to merge making it hard to read

This is even worse than Dapper's hidden cheeses.

The logic and physics stuff you and Dapper do is amazing!
Track idea --- Driving up the outside of a really scaled up tube with fans or something so you can drive up any part of it without falling. You could make it a choose your route map to find the fastest time. Kind of the opposite of Dapper's old giant pot hole track. Bonus points if you can figure out how to give people an option to transition to the inside of the tube or force them to transition back and forth.

Just use the universal key, a 12 gauge!

I understood the diagram until Kan explained it, I then had no idea if I was correct

Ok so apparently everyone is mad that I didn't do the bridged connections on the second part of the puzzle accurately. This is very true.

I'd also like to point out that electrical engineering is wizard voodoo magic that is impossible to understand regardless.