The structure of a botA bot is a text file with its DNA: genes one after another, comments, def and words separated by spaces.
Genes: cond, start, else and stopHow a gene is built with cond, start, else and stop, which parts of the DNA run, and how genes are numbered.
The integer and boolean stacksThe DNA computes with two stacks, one of numbers and one of true or false: how much they hold, what happens when they fill up or run empty, and when they start from zero.
Numbers and addressesWhich numbers you can write in the DNA, how memory is read with the asterisk, why a sysvar is just an address, and what happens with out-of-range values and addresses.
Writing to memoryHow store, inc, dec and the rest of the family write to the bot's memory, what they take from the stack and when the engine acts on what you wrote.
Operators by familyAn overview of the DNA operators grouped by family: what each one takes from and leaves on each stack, and the most common ones with an example.
Inline conditionsComparisons leave trues and falses on the boolean stack; this page covers how they combine with and, or and not, and how they decide which stores run, before and after start.
Variables with defHow to give a name to a memory address or to a number with def, how those names are resolved, and what traps they have.
Free and epigenetic memoryThe map of a bot's 1000 memory cells: which ones the engine uses, which ones are yours, what gets cleared on its own and what is passed on to children.
Execution and costsWhen the DNA runs within the cycle, in what order, what it sees of the senses, and how much energy each instruction costs.
Common mistakesThe most common stumbles when programming a bot, with their symptom, their cause and how to fix them.
The .txt formatWhat a bot's .txt file looks like on the inside: lines, comments, the '# header, the encoding, and what changes when the engine exports it.