{{Infobox level
| section = Arithmetic
...
464 bytes (41 words) - 00:11, 14 November 2023
* [[Level/Crude Awakening|Crude Awakening]]
* [[Level/NAND Gate|NAND Gate]]
...
3 KB (422 words) - 16:26, 22 August 2024
{{Infobox level
| prerequisite1 = Arithmetic Engine
...
1 KB (161 words) - 11:26, 23 August 2024
{{Infobox level
| section = Arithmetic
...
1 KB (210 words) - 14:36, 23 August 2024
This level has you create a basic arithmetic circuit that adds two bits and gives the result in the form of the sum and
...
380 bytes (68 words) - 20:53, 28 October 2023
{{Infobox level
| section = Arithmetic
...
2 KB (325 words) - 11:39, 23 August 2024
{{infobox level
| section = Arithmetic
...
861 bytes (106 words) - 21:14, 17 November 2023
{{Infobox level
| section = Arithmetic
...
700 bytes (81 words) - 11:18, 22 August 2024
* [[Component/Shift|8 Bit Arithmetic Shift right]]
=== Level ===
...
3 KB (333 words) - 07:47, 2 September 2024
For this level you have to create a component that either increments by one each tick or l
|description=Complete the Counter level with a 65 gate score or less
...
2 KB (355 words) - 20:44, 28 October 2023
Remember the level Bit Inverter? We can use a bitwise XOR (written <code>^</code>) to selectiv
...completely arithmetic way - the value is <code>255</code>, which in 8-bit arithmetic is the same as <code>-1</code>. What’s the easiest way to get <code>-1</c
...
17 KB (2,860 words) - 00:13, 8 September 2024
