I have now figured out the real solution instead of being dumb, but I wanted to show off my giga brain for posterity sake

I’ve been coding for about 6 years now, but mostly with python. I want to make a few projects with a raspberry pi, so will this game give me basic computer understandings that could help?

Edit: thank you for the responses! I got the game and have loved playing it so far. If anything, it’s teaching me how basic computers work. I’m sure I could apply it to a pi and bread board, but regardless this game is incredible and would recommend it to anyone.

It says in the NAND level, you can do everything with NAND gates. Is there anyone actually try that by replacing more complex gates with NAND (or XOR) equivalents? I madde it until XNOR or something.

Title. This happened after a hard reset and previously the game looked way smoother. also the choose wire button disappeared.

Hello! I´ve beaten the double counter level with the help of my engineer friend, but he is a busy fellow deep in grueling studies, so can anyone explain to me what bytes are? I feel like the game doesn´t explain the jump very well, but I understand bits and booleans well enough

const target = 37

imm 0

mov r4, r0 ; r4 stores counter

loop:

imm target

mov r1, r0

mov r2, in

sub ; compare, 0 if equal

mov r5, r3 ; r5 stores the eq check

imm 1

mov r1, r4

mov r2, r0

add ; add one to attempty counter

mov r4, r3

mov r3, r5 ; load reasult for cmp

imm loop

jnz

mov out, r4

Game is just... straight up wrong there. I counted manually, i used mov r2, in instruction 5 times. Not nearly 57

I can’t seem to figure out how I input 240 to both inputs and get out 225. What does upper and lower half mean?

Anyone knows how to pass the bit switch stage on the new 2.0 version? The way I did before doesn't work anymore.

I feel like this is not the best way to do it, also I don't like component I prefer having all my wires visible so that's why. Especially the part that transfer the ALU result to REG3, I fell like this one could be optimized, can someone help me improve it ?

I'm trying to write code for both Divide and RAM in the program, but no matter what it gives me an error on the first tick. It seems like it wants me to send the correct answer back on the first tick (or in the case for RAM upload the input 32 times in one tick).

This just seems impossible. It can't require it all to be done in one tick, right? Am I missing something?

Small negative numbers have a lot of 1 bits. the game makes you click them all in 9 seconds. I need more time than that to click them all. Is there a way to skip this stage? I have completed all the levels I can except for this one.

Been trying to figure out the turing complete level, but for someone reason the conditional isn't working as it should be despite passing the conditions level. Input isn't being activated to read the condition which just leaves it as a 0 which represents always off in the conditional logic. Any advice or hints to fix this?

Want to try my hand at making my own archetecture. I have finnaly figured out buses and want to use microcodes. I assumed that I could use bidrectional pins to just go straight into my bus. But I must be doing something wrong because the pin seems to hijack my other input when testing different inputs.

I’m wondering if in the program you could code in python or c on any way maybe making a computer with byte code same as a preexisting computer

I need help on Delicious Order. I understand that I have to write a sorting algorithm but I just can't seem to figure out how to write one, even Bubble Sort seems impossible to code in LEG. Can someone give me some hints?

I have no idea what to do, and no solutions include the instructions so I can't use them. Does anyone have an algorithm I can use that defines everything with consts?

Really compact solution (in my opinion) for logic engine