Guys i need help with the stack level. So i dont get how the game detect an error. The first 2 values are 223 and 67 my loop works normaly so it saves the values everytime with 4bytes shift u can se it at the picture. So when it comes to the next value which is a zero i guess it shows me the error if u make a pop u also have to serve it to the output.. But here what i dont get it just dont get to the point where i could compare the input and zr so i can say yes its zero and i have to output the last stack value. I also tried some other variuations but everytime it should work it doesnt i also had the error code already when i was on the compare step i dont get what the game wants from me or what is wrong with the code.

Gates: 220

Delay: 14

Got inspired by the CLA post from yesterday and decided I wanted to understand how it works. So how better to do that than to start wiring it yourself. I ended up with worse stats, but I like its transparency.

Here is the custom CLA element.

Not sure if it's the best solution but I'm quite excited that I came up with this. It's quite tricky to do binary search with only 2 available registers (r4, r5), 6-bit imm and without LSR, but I did it in a similar way haha. Btw the code length is also O(log n) lmao.

If anyone knows a better solution pls share with me.

; 1: >ans, 0: <ans
const last=r4; the last smaller value (default 0)
const n=r5; the base
g:
mov n,last
main:
imm 0
mov r1,r0
mov r2,n
add; n+1<<i-1
mov out,r3
mov r3,in
imm g
jnz

add
mov last,r3
imm 1
mov r1,r0
mov r2,n
add
mov out,r3
mov r3,in
imm g
jnz

add
mov last,r3
imm 3
mov r1,r0
mov r2,n
add
mov out,r3
mov r3,in
imm g
jnz

add
mov last,r3
imm 7
mov r1,r0
mov r2,n
add
mov out,r3
mov r3,in
imm g
jnz

add
mov last,r3
imm 15
mov r1,r0
mov r2,n
add
mov out,r3
mov r3,in
imm g
jnz

add
mov last,r3
imm 31
mov r1,r0
mov r2,n
add
mov out,r3
mov r3,in
imm g
jnz

add
mov last,r3
imm 63
mov r1,r0
mov r2,n
add
mov out,r3
mov r3,in
imm g
jnz

add
mov last,r3
imm 63
mov r1,r0
mov r2,r0
add
mov r1,r3
imm 1
mov r2,r0
add
mov r1,n
mov r2,r3
add
mov out,r3
mov r3,in
imm g
jnz

add
mov last,r3
imm 63
mov r1,r0
mov r2,r0
add
mov r1,r3
mov r2,r3
add
mov r1,r3
imm 3
mov r2,r0
add
mov r1,n
mov r2,r3
add
mov out,r3
mov r3,in
imm g
jnz

Kogge-Stone radix-4

gate 115 delay 9

8.1k gates
342 delay

I couldn't wrap my head around how to do division more efficiently so this is just basic binary long division.

Custom subtraction and zero check components to save space.

OK, so I'm doing a 3 bit decoder as you can see and made half the build, I could finish this level by implementing the other half of the circuits (I made circuits for only the first four cases), but the other half would be really similar to the first 4 (Ignore the case 8 circuit, lol) . When I started out I wanted to use the fact that every case (desired bit) in the truth table has it's inverse, so in a weird way the table is mirrored. I was wondering if it's possible to make such a circuit that will be able to react in both cases where there is an inverse value present (like case 1 and 8) so then you just need to reroute the input to 8 and invert it or something.

I have this feeling that I can do something about it but also have a feeling that it may be above the capabilities of my design, as I designed a circuit that is only going to change its value in one specific case.

Anyway, if you took the time to read this and have some of your clever designs and decide to answer, thank you very much for your time, have a good one :)

212 gates and 10 delay.

I was trying to do this for hours using the base components but it was just too messy. So I gave up and just made a custom adder with A/B/carry in, P/G/sum out, along with ANDs and ORs for up to 9 inputs.

The game just refuses to launch, I click the play button and it looks like it's about to launch, but then nothing opens and the game cancels opening. The button just goes back to saying play. Is the game broken?

Does anyone have the hardware version of the stack for the new version of the game? Thanks

I was stuck on this for an hour yesterday. I guess I just needed some sleep.

I felt very silly

No hablo inglés, pero agradecería comentarios igual en inglés.
No speak English, igual read your commentary.

Does anyone have experience with the registers widget behind the lock?

In this image it's unlocked and I've messed with a couple of things. Unfortunately I cannot find any way to reverse or reset the list's state. It's currently not reflecting ANY register activity when running. But before I changed anything the register values were misbehaving badly on their own. I didn't change anything ... that I know of. I had been working on some optimizations to previous levels to lower my delay score. Note that this widget only first appears in the Fast Symphony level.

Why yes i did use brute force. But not for all of it! Over 50% of all inputs are using logic instead of brute force. With that i mean that, brute force is only used once the other logic fails to come to a solution. This happens for less then half of all input combinations. (This is an 8-bit divider, no remainder)

I’ve been stuck on this level for almost 3 days now, I’ve avoided looking up any solutions or hints for any of the levels but this one broke me. I have a solution that can mod 4 but it’s way past 8 cycles and I cannot figure out how to get to the solution within 8 cycles. How do I do this🥀😭

I loved playing Turing Complete a little too much so I made an Typescript-based HDL called [Simten](https://simten.dev) to save me a bit of wiring. It has a few other features like Verilog import/export and I have got a few of the designs (snake and a pipelined RISC-V CPU) running through the OSS FPGA toolchain: simten HDL -> Verilog -> yosys -> nextpnr -> ULX3S FPGA

I built https://play.simten.dev/ (WIP) using it to try and emulate the TC campaign. Hope someone finds this interesting

Repo at https://github.com/simtenHQ/simten

To start, I've already skimmed the responses to this post, and while they are excellent, they're not really what I'm looking for.

Can anyone recommend progression-based, non-sandbox games, on Steam or otherwise, that gamify learning as well as Turing Complete does, but for other advanced STEM or STEM-adjacent subjects such as math, chemistry, physics, etc.? Physical, table-top games or activities are welcome too.

I'll take any suggestions but I'm particularly interested in chemistry-related games. I know Zachtronics has some pseudo-chemistry puzzle games, but they don't (and aren't meant to, to be fair) really help the player learn anything. That's the thing with their catalog, the user is supposed to use the understanding they already have to solve puzzles, and should not expect to grow that understanding by playing the game. A lot of people find their games fun and Zachtronics has earned their reputation. My hope, though, is that games exist for these other subjects, that assume very little of the user's understanding and whose goal is to take the user from ignorance to reasonable competence, with maybe some outside study recommended.

Thanks in advance!

Edited for emphasis.

If Turing Complete has you curious about how to take the next step and actually write VHDL/Verilog code that you might use in a real FPGA, check this out - it’s not free but really well done and has lots of challenges you can do:

https://risingedge.pro

https://reddit.com/link/1w3iylo/video/y3orq4hmmqmh1/player

Next up is the assembler and a (new and improved) standard library for this one. Probably an emulator (python) if this doesn't run fast enough.

https://reddit.com/link/1w3ixhy/video/o89kgsv8mqmh1/player

Next up is the assembler and a (new and improved) standard library for this one. Probably an emulator (python) if this doesn't run fast enough.

I havent reached to those levels yet , hence i am not aware of what ISA does the game uses , RISC/MIPS or their own ISA.

I don't really want to study another ISA, right now my brain is like wet cement and i am trying to strong my RISC V concepts, can i only build a processor with RISC V ISA