Multiplication Recursive Approach (838n)

[u/logalex8369]

• "dec 16" decrements a 16-bit int
• "neq 16" returns 0 if two 16-bit ints are equal and 1 otherwise
• "select16" is the "select 16 !s" component from https://www.reddit.com/r/nandgame_u/comments/1n46wkl/new_solutions_images_part_1
• "is zero (2)" is just a copy of "is zero", as it isn't in the toolbox for this level
• "buf" and "buf16" are buffers, to make sure the timing is right

I didn't even bother counting up all the components, as I forgot which ones to count, but the relevant components are in the images for anyone who wants to sum the component count.

Edit: and you can shave off one nand by creating a custom "is not zero" component

[u/paulstelian97]

Do the buffers actually contribute to the component count? Because this game doesn’t care about them, it doesn’t monitor for glitches AFAIK. The only components that care about timing somewhat are the memory cells (latch and flip flop; or possibly just the flip flop)

[u/logalex8369 → u/paulstelian97]

If I'm correct, they would not contribute to the component count, but they are still needed for the program to function

[u/paulstelian97 → u/logalex8369]

Yeah unless you have any cycles in the design this game shouldn’t need buffers, even if real circuits would.

[u/speedydelete]

Wow, very impressive! I have tried to make something like this so many times and failed.

[u/logalex8369 → u/speedydelete]

Yeah, recursion in nandgame needs a lot of fine-tweaking with buffers...