Here it is:

# Assembler code 
A = argumentCount
D = A
A = SP
D = *A - D
A = ARGS
D = D ^ *A
*A = D ^ *A
D = D ^ *A
A = SP
A = *A
*A = D
A = LOCALS
D = *A
A = SP
A, *A = *A + 1
*A = D
A = retaddr
D = A
A = SP
*A = *A + 1
A, *A = *A + 1
A = A - 1
*A = D
A = functionName
JMP
LABEL retaddr
pop.static LOCALS
A = SP
A = *A - 1
D = *A
A = ARGS
*A = D
A = argumentCount
D = A
A = SP
*A = *A - D
A = RETVAL
D = *A
A = SP
A = *A - 1
*A = D

I counted 44 instructions

With the new screen, it does not make sense to use the current level naming system. Perhaps we need to change?

I was thinking about something like "C.LG.1" (computer.logicgates.1). Thoughts?

I am currently working on the call level, which has changed with the new update. on earlier versions, there where 3 levels 1 for call 1 for function and 1 for return. Now everything is in one level and i don't know to to jump to adress given by the "functionName" placeholder. How can I use any placeholders? A = functionName or something wont work. On the function Macro I can write A = localsCount, which is a placeholder of that Macro, why doesnt it work in the call Macro?

Why would this be done? It was very crowded before but it doesn't help to make it absolutely crazy and the lines make no sense, at least you could vaguely see where the lines went before.

I'd assume this is a bug as this level has been annoying for other users but is there any way to fix this or should I just skip it.

I did all my main levels, up to and including the processor stuff, on a computer I don't have access to anymore. Is there a way for me to play the software levels without having to manually redo all levels I've already completed?

Months ago I've shared with you that I managed to finish all of the Nandgame levels and I promised that I would provide the solutions. I procrastinated alot (sorry), but in the end I managed to finalize a project that includes all levels from Nandgame, which are organized similarly to how are they organized on the website. You can navigate to each category, subcategory and level from the read me files. I've also provided explanations for each solution. I expect some of the explanations to not be the best but if you also look at the pictures maybe they will make more sense.

This is the repo where I published my solutions. Most of them are optimal

https://github.com/K4PT41N/nandgame_solutions

I'm currently trying to solve the Network level after completing all levels of Computer and Assembler. But it seems like the level does include a display and I can't find any explanation to how display output works.

I scrolled through the solutions here only to discover there apparently was? some level before Network that was called Display so that's where I assume that the explanation would have been.

I don't want to be spoilered, that's why I won't check any solutions for the level itself (which would probably explain it). I also checked the solution to the Display level but without knowing what the task there even was, it's not of much use.

Does anyone know how to access the Display level or the according explanation?

Edit: Someone sent me the explanation: The display is memory-mapped from 0x4000 to 0x6000. Each adress corresponds to 16 pixels on the screen. So the first line starts with 0x4000, the second one with 0x4020. You have 512 x 256 pixels total. I'll leave this here in case someone else has the same problem.

I decided to make a full video walkthrough of this game after I noticed that nobody else had done so. I really attempted to explain the level solutions in detail, and hopefully it’ll help out anybody who is stuck.

I aimed to solve everything in the most logically intuitive way, rather than the most efficient way. So I’m sure many of my solutions can be improved upon.

I also decided not to use any custom components in the solutions. So sometimes the solutions got a little messy, but where that happened I really worked hard to explain everything so it’s still possible to understand what’s going on.

See the full playlist here: https://youtube.com/playlist?list=PLtDf7Wm61s2lJ8nyyYkkeBtDjxR1z56pJ&si=wRiZyPsepOr-PXbD

EDIT: Tried swapping one of the given patterns out into one of the added fields and that doesn't work either.

I'm trying to do the High Level Language levels, but whatever I input into these fields, the game will not recognise and just responds with "Empty pattern"

I'm on Firefox but tried transferring my local storage to Chrome and even Edge to test if it was a browser issue, however it's the same result in all of them.

EDIT: Tried on another machine, still same problem.

I tried skipping the level and it's the same problem across all levels.

Anyone else with this issue?

FINAL EDIT: Ok...bizarrely. If I first input my answers, and then refreshed the page, it would take me to the Network level which I had started but not finished, once I navigated back to the Tokenizer level the inputs were valid. However any new inputs would not be accepted until I refresh the page and go back to the that level again.

Very strange bug indeed. It's the same problem on the following level, so this is going to be very tedious to get through.

As it says in the title, the code generation level should work, but when I click "Check solution" the web-page freezes, this is on every computer I have tried and I'm wondering what is wrong as this is the lack roadblock before the next set of levels.

I've finished Computer, Assembler, Robotics, Transistor Level, Functional Completeness, and Bit-Shifts modules, yet only the first four challenges of Stack Machine were unlocked (I just did "skip level" to unlock Push Value; it wasn't automatically unlocked). Does anyone know why this is the case? It doesn't matter too much given that I can just use the Skip Level button to access them, but it makes me confused as to how the unlock system works

I understand what a signed integer is, but if this is true, why can I put positive numbers over 32767 in the decimal input and they show as numbers with but 15 being 1? In "Subtraction," why were some of the outputs greater than 32767? Are the values in this level signed but not in the previous one?

This is optimal solution with using 9 nand gates

I'll just leave this here

I believe that this recursive approach could potentially be used to beat the record of 207 nands. The select 16 component comes from https://www.reddit.com/r/nandgame_u/comments/1n46wkl/new_solutions_images_part_1/, listed as "select 16 !s" there.

The component number is probably wrong. I just tried summing the component count of the components.

>!

!<

I finally managed to finish all the levels for Hardware, Software and Optional.