撰写了文章更新于 2018-09-29 02:39:10

Level Walkthrough

FAKE SURVEILLANCE CAMERA

¥6 Cost 58 Power 5 Lines

@ slp 6 gen p0 6 6

@ slp 4 gen p0 2 1 gen p0 1 4

Hint:gen can only start with 100 end with 0, but if you combine it with a NOT gate...¥8 Cost 60 Power 3 Lines

gen p0 6 6

gen p0 4 2 gen p0 1 1

CONTROL SIGNAL AMPLIFIER

Provide by KoTaM¥4 Cost 146 Power 4 Lines

teq p0 25 + mov 50 p1 slp 1 + mov 0 p1

¥3 Cost 240 Power 4 Lines

mov p0 acc mul 2 mov acc p1 slp 1

Hint:Notice that we only have 3 distinct inputs:0,25,50. And we also know that the address of memory chip is calculated by mod 17.

¥5 Cost 180 Power 3 Lines

mov p0 x0 mov x1 p1 slp 1

• DIAGNOSTIC PULSE GENERATOR

¥8 Cost 426 Power 1 Lines

gen p1 1 1

¥3 Cost 142 Power 3 Lines

teq p0 100 + gen p1 1 1 - slp 1

Hint:To build a sequence circuit with logic gate, a MC chip is necessary.

¥6 Cost 120 Power 2 Lines

mov p1 p0 slp 1

• ANIMATED ESPORTS SIGN

¥7 Cost 172 Power 14 Lines

mov 100 p0 mov 0 p1 slp 1 mov 0 p0 mov 100 p1 slp 1

mov 1 x2 slp 6 mov 10 x2 slp 1 mov 100 x2 slp 2 mov 10 x2 slp 1

¥14 Cost 128 Power 3 Lines

gen p1 1 1

gen p1 6 4

gen p1 8 2

Provide by KoTaM¥8 Cost 126 Power 9 Lines

mov 1 x2 slp 6 mov 10 x2 slp 1 mov 100 x2 slp 2 mov 10 x2 slp 1

gen p0 1 1

• DRINKING GAME SCOREKEEPER

Provide by KoTaM¥3 COST 170 POWER 8 LINES

tcp p0 p1 - add 1 + sub 2 + tlt acc 0 + mov 0 acc - mov acc x1 + mov acc x1 slp 1

¥5 COST 208 POWER 7 LINES

tcp x1 10 - add 1 + sub 2 + tlt acc 0 + sub acc mov acc x2 slp 1

• HARMONIC MAXIMIZATION ENGINE

Provide by SErAphLi'S¥4 COST 285 POWER 7 LINES

teq x0 100 + mov p0 acc + mul 4 + sub 150 + mov acc p1 - mov p0 p1 slp 1

¥4 COST 310 POWER 6 LINES

tcp x0 p0 mov p0 acc + mul 4 + sub 150 mov acc p1 slp 1

• PASSIVE INFRARED SENSOR

Provide by RTCP¥6 COST 302 POWER 8 LINES

teq p1 x0 + mov 10 acc teq p1 x1 + mov 0 acc tgt p0 19 + mov acc x3 - mov 0 x3 slp 1

• VIRTUAL REALITY BUZZER

¥3 COST 111 POWER 5 LINES

@ teq 0 0 + teq x0 -999 - gen p1 1 1 - teq x0 0 + slp 1

¥11 COST 254 POWER 4 LINES

mov x1 x0 slp 1 teq p0 100 + gen p1 1 0

Provide by KoTaM, SErAphLi'S¥3 COST 124 POWER 7 LINES

teq x0 1 - jmp end 1:gen p1 1 1 teq x0 0 - jmp 1 slp 2 end: slp 1

• WIRLESS GAME CONTROLLER

¥8 COST 125 POWER 10 LINES

@ slp 1 teq x0 -1 + mov p0 x1 + mov p1 x1 + mov 0 acc + dst x3 2 + add x2 + mov acc x1 + slp 4 E:- slp 1

Provide by KoTaM, SErAphLi'S¥6 COST 135 POWER 11 LINES

tcp x0 -2 - jmp 9 mov p1 x1 mov p0 x1 tgt x3 9 - mov x3 x1 + mov x3 acc + sub 8 + mov acc x1 slp 3 9: slp 1

¥8 COST 204 POWER 8 LINES

teq x0 -1 + mov p0 x1 + mov p1 x1 + mov 0 acc + dst x3 2 + add x2 + mov acc x1 E:slp 1

• LASER TAG EQUIPMENT

¥7 COST 240 POWER 9 LINES

@ mov 10 x1 @ nop tgt x1 10 + mov x0 acc teq p1 100 + tgt acc 0 + sub 1 + mov 1 x1 slp 1

Provide by KoTaM¥7 COST 321 POWER 14 LINES

1: teq x0 0 + jmp 8 tgt x0 9 + mov 100 p0 - mov 0 p0 8: tgt x2 99 + mov x1 acc + slp 1 + jmp 9 teq x2 11 + tgt acc 0 + sub 1 + gen p1 1 0 9: slp 1

• COLOR-CHANGING VAPE PEN

Provide by KoTaM¥8 COST 229 POWER 16 LINES

mov x0 acc tlt acc 0 + jmp 9 mov x0 x3 mov acc p1 mov x0 acc teq acc 999 - slp acc - mov x0 x3 - mov x0 p1 - slp 1 + slp 5 9: slp 1

slx x1 mov x1 p1 mov x0 p0

¥6 COST 262 POWER 18 LINES

mov x0 acc teq acc -999 - mov x0 x1 - mov x0 p0 - mov acc p1 - slx x1 - teq x1 0 - mov p0 p1 slp 1

slx x1 mov x1 p1 nop mov x0 acc teq acc 999 + mov 0 x1 - slp acc - mov 1 x1 - mov p1 p1

¥8 COST 594 POWER 12 LINES

mov x1 dat teq dat -999 + tgt acc 0 + jmp E mov x1 x0 mov dat p1 mov x1 acc E:sub 1 slp 1

slx x1 mov x1 p1 mov x0 p0

• UNKNOWN OPTIMIZATION DEVICE / Device 2A27

Provide by KoTaM¥6 COST 705 POWER 14 LINES

tgt p1 39 + tlt p1 80 + tgt p0 39 + tlt p0 80 + mov 50 x1 - mov 0 x1 slp 1

tgt p0 19 + tlt p0 60 + mov 0 acc - mov 30 acc add x0 mov acc p1 slp 1

• TOKEN-BASED PAYMENT KIOSK / Three Kingdoms Tokens

Provide by KoTaM¥11 COST 287 POWER 23 LINES

teq x1 0 + jmp 1 tcp x1 10 add 5 - sub 4 + add 7 tlt acc x0 - sub x0 - mov acc x2 - gen p1 4 1 - sub acc slp 1 1: slp 1

slx x0 mov x0 acc 2: tlt acc 5 - gen p1 1 1 - sub 5 - jmp 2 3: tlt acc 1 - gen p0 1 1 - sub 1 - jmp 3

• PERSONAL SANDWICH MAKER / Sandwich Assembler??

Provide by KoTaM¥6 COST 85 POWER 14 LINES

slx x0 gen p1 1 0 mov 100 x2 slp 1 mov 10 x2 tcp x0 2 - slp 1 + slp 1 mov 1 x2 + slp 1 slp 1 mov 0 x2 gen p1 1 0 gen p0 3 3

• CARBINE TARGET ILLUMINATOR / Carbine Target Illuminator

Provide by KoTaM¥9 COST 152 POWER 11 LINES

@ mov 1 dat slp dat tcp p0 x3 - mov 8 acc - mov 1 dat + mov acc dat + mul 2 + mov acc x1 + mov x0 x2 + mov x0 p1 sub 1

• HAUNTED DOLL / Can You Keep a Secret?? Haunted...

¥9 COST 411 POWER 11 LINES

@ mov 50 acc tlt p0 3 + mov p0 dat teq dat 1 + mov x0 acc - teq dat 0 - mov x2 acc mov acc p1 teq acc 50 + mov 0 dat slp 1

Provide by KoTaM¥9 COST 205 POWER 14 LINES

@ mov 50 p1 3: slp 1 tcp p0 2 + jmp 3 - jmp 1 2: mov x2 p1 slp 1 teq x3 0 - jmp 2 + jmp 3 1: mov x0 p1 slp 1 teq x1 0 - jmp 1

• AQUAPONICS MAINTENANCE ROBOT

¥10 COST 209 POWER 25 LINES

@ mov 50 p1 slx x1 mov x1 dat L:tcp dat acc + add 1 - sub 1 + gen p1 1 0 - gen p1 0 1 mov 50 p1 + slp 1 - slp 1 + jmp L - jmp L mov 0 x1

S:slp 1 mov x0 acc tlt acc 0 + jmp S mov acc x1 mov x0 acc mov x0 dat slx x1 mov x1 null gen p1 acc 0 gen p0 dat 0

Provide by KoTaM¥11 COST 175 POWER 27 LINES

0: slp 1 mov x0 acc teq acc -999 + jmp 0 teq acc dat - mov acc x1 - slx x1 - mov x1 dat mov 100 x2 slp x0 mov 1 x2 slp x0 mov 0 x2

mov 50 p1 slx x0 mov x0 dat 1:tcp dat acc + add 1 + mov 100 p1 - sub 1 - mov 0 p1 slp 1 mov 50 p1 slp 1 teq acc dat - jmp 1 mov dat x0

• REMOTE KILL SWITCH

Provide by KoTaM¥8 COST 299 POWER 14 LINES

0: mov x0 dat tcp dat -1 - jmp 9 + dst x0 dat + mov acc x1 mov 0 x3 + slp 1 + tgt x2 100 slp 1 jmp 0 9: tgt x2 4 + mov 0 acc + mov acc x1 slp 1

• SMART GRID CONTROL ROUTER

Provide by KoTaM¥5 COST 298 POWER 10 LINES

1: slx x0 mov x0 acc tgt acc 100 + mov acc dat tcp dat x3 - mov acc x1 - jmp 1 + mov acc x3 + jmp 1 mov acc x2

• POCKET I CHING ORACLE

¥12 COST 319 POWER 28 LINES

S:teq p0 0 + slp 1 + jmp S slp 3 mov 0 acc teq p1 0 - dst 0 1 slp 1 teq p1 0 - dst 1 1 slp 1 teq p1 0 - dst 2 1 mov acc x2

S:teq p0 0 + slp 1 + jmp S mov 0 acc teq p1 0 - dst 0 1 slp 1 teq p1 0 - dst 1 1 slp 1 teq p1 0 - dst 2 1 slp 3 mov acc x3

Provide by KoTaM¥13 COST 203 POWER 18 LINES

9: slp 1 teq p0 100 - jmp 9 lp: dst x0 x3 slp 1 dst x0 x3 slp 1 dst x0 x3 mov acc x2 slp 1 teq x1 6 - jmp lp + mov x0 x1 #clr

slx x0 mov x0 acc slx x0 mov x0 x3 mov acc x2

• PRECISION FOOD SCALE

¥5 COST 403 POWER 12 LINES

@ mov -999 dat mov p1 acc teq p0 100 - jmp A teq dat acc + mov -999 dat + mov -999 x3 - mov p1 dat A:teq dat -999 - sub dat - mov acc x3 slp 1

• CRYPTOCURRENCY DEPOSIT TERMINAL

¥14 COST 809 POWER 29 LINES

mov x1 acc mov acc x0 tgt acc -1 - jmp E mov acc x2 L:mov x1 x2 teq x3 8 - jmp L E:slp 1

teq x0 -1 + mov 0 x2 + mov acc x3 + mov 0 acc S:teq x1 0 + jmp E teq x1 1 + add 20 teq x1 10 + add 50 teq x1 100 + add 100 E:slp 1

slx x1 mov x1 acc mov 0 x3 L:mov x0 x2 teq x3 8 - jmp L mov acc x2

Provide by KoTaM¥14 COST 512 POWER 31 LINES

mov x0 dat tcp dat -1 + mov dat x2 + jmp 0 - jmp 1 mov acc x3 sub acc 1: tcp x1 1 - jmp 0 add 20 + teq x1 100 + add 80 - add 30 0: slp 1

slx x0 mov x0 x2 2:mov x1 x2 mov x1 x2 teq x3 7 - jmp 2 mov x1 x2 mov x2 x3

slx x3 2: mov x0 x2 mov x0 x2 mov x0 x2 mov x0 x2 teq x1 8 - jmp 2 mov x3 x2 mov x0 x1

• POLLUTION-SENSING SMART WINDOW

Hint:we save all data into a memory chip and keep the two data port of it differ by 8. So we can easily calculate the sum of last 8 ticks.

¥7 COST 277 POWER 8 LINES

@ mov -8 x2 sub x3 add p0 mov p0 x1 tgt 400 acc + mov 100 p1 - mov 0 p1 slp 1

Provide by KoTaM¥8 COST 231 POWER 7 LINES

@ mov 7 x1 @ sub 350 add p0 mov p0 x3 mov acc p1 slp 1 sub x0

• TRAFFIC SIGNAL

¥14 COST 579 POWER 28 LINES

@ add x0 @ add x1 @ mov acc dat @ add x3 teq p0 100 + mov 0 x3 + jmp E mov x0 x2 mov dat x2 mov acc x2 E:slp 1

@ mov x3 x1 slx x1 mov x1 x2

teq p0 100 + mov 0 acc + jmp B tlt acc x0 + mov 100 x3 + mov x0 null + jmp A tlt acc x0 + mov 10 x3 - mov 1 x3 A:add 1 teq acc x0 + mov 0 acc B:slp 1

Provide by KoTaM¥15 COST 275 POWER 26 LINES

@ mov 100 x2 @ mov x3 x2 @ mov 10 x2 @ mov x0 x2 @ mov 1 x2 @ mov x1 x2

@ not 2: mov x0 x3 mov x0 acc 1: teq p0 0 - sub 1 - slp 1 + mov 0 x2 + slx x2 + mov x2 x1 + jmp 5 teq acc 0 - jmp 1 teq x1 6 5:+ mov 0 x1

slx x0 mov x0 x1 1: teq p0 0 + slp 1 + jmp 1 mov 0 x0

• MEAT-BASED PRINTER

Hint:case 3 is easy to handle with, we can do it in 3 lins, so we pre-store other twos in a memory chip.

¥11 COST 165 POWER 20 LINES

slx x0 mov x0 acc sub 1 mul 7 mov acc x1 gen p0 7 0

slx x2 mov x2 acc teq acc 14 + mov 11 x3 + slp 7 + jmp E mov acc x1 mov 7 acc L:mov x0 x3 slp 1 sub 1 teq acc 0 - jmp L E: mov 0 x3

• ELECTRONIC DOOR LOCK

Hint:Maintain two flag digits during check the password. if any digit of input isn't 9 then dst 0 1, else if it isn't equal to former saved password then dst 1 1. So eventualy the door will unlocked acc isn't equal to 11, namely input doesn't pass any of two tests.

¥13 COST 389 POWER 27 LINES

slx x0 teq p0 100 + jmp E mov 0 x3 mov 0 acc L:mov x0 dat teq dat 9 - dst 0 1 teq dat x2 - dst 1 1 teq x3 10 - jmp L E:mov acc x1 slp 1

S:slx x0 teq p0 100 + mov null x1 mov x0 acc + jmp S teq acc 11 - gen p1 6 0

• DEEP SEA SENSOR GRID

@[CN]Solara's solution is much better than mine, I use his idea and refine his original solution a little bit. All three indexes are better than old one, so I retire it permanently.

Hint:We need 2x6 cells to store old value, and 2 cells to store current value, notice that the memory chip has exactly 14 cells.

¥12 COST 486 POWER 16 LINES

mov p0 x0 mov p1 x1 slp 1

@ mov 9 x0 teq x3 1 - jmp E mov x0 acc mov x0 dat add 6 tgt acc 13 + sub 14 L:mov x1 x2 teq x0 acc - jmp L mov dat x0 E:mov x1 null slp 1

@ mov 9 x1 teq x2 2 - jmp E mov x1 acc mov x1 dat add 6 tgt acc 13 + sub 14 L:mov x0 x3 teq x1 acc - jmp L mov dat x1 E:mov x0 null slp 1

teq x2 x3 - mov 0 x0 - mov 0 x0 - jmp E mov x2 acc mov acc x0 mov acc x0 E:slp 1

Provide by KoTaM¥13 COST 400 POWER 21 LINES

mov p0 x0 mov p1 x1 slp 1

slx x2 teq x2 1 mov x1 dat mov x1 acc + add 1 - sub 6 mov acc x1 mov x0 x3 mov x0 x3 mov x0 x3 mov x0 x3 mov x0 x3 mov x0 x3 mov dat x1

@ mov 7 x3 teq x0 x1 + mov x1 x2 slp 1

teq x2 x3 - mov 0 x0 - mov 0 x0 - jmp E mov x2 acc mov acc x0 mov acc x0 E:slp 1

• SPOILER BLOCKING HEADPHONES

Provide by KoTaM¥13 COST 860 POWER 25 LINES

1: slx x3 mov x3 dat 2: tcp x0 dat - jmp 2 + jmp 3 mov x1 acc add 6 mov acc x1 3: teq x0 x2 + add 50 - mov 0 acc mov 0 x1 mov acc x3

teq x2 100 + sub acc - mov x1 dat - teq dat -999 + jmp 9 mov dat x0 slx x0 add x0 9: tgt acc 50 + mov 50 p1 - mov p0 p1 slp 1

• COLOR COORDINATING SHOES

Provide by KoTaM¥22 COST 838 POWER 43 LINES

teq p1 0 - mov p0 acc - dgt 1 - mov acc dat - mov dat x3 - mov x2 acc - add 1 - mov dat x3 - mov acc x2 - jmp 9 tgt dat 0 + mov 2 x1 + mov 0 dat 9: slp 1

slx x2 mov 0 x0 0: teq x0 9 - mov 0 x1 - jmp 0

slx x3 mov x3 x1 mov x0 acc add x0 0:mov x1 dat tgt x0 acc + mov 0 x1 + mov dat x0 + mov dat x1 + mov x0 acc teq x1 9 - jmp 0 mov 0 x1 mov x0 x2

@ mov 50 p0 @ mov 50 p1 slx x2 mov x2 acc teq acc 0 + add 2 mul 2 mov acc x1 mov x0 p1 mov x0 p0

• AIRLINE COCKTAIL MIXER

Provide by KoTaM¥15 COST 139 POWER 16 LINES

slx x0 mov x0 acc mul 2 mov acc x3 mov acc x2

slx x3 1: mov x0 x2 slp x0 teq x1 6 + jmp 1 mov 0 x2

slx x3 mov x3 x1 mov x0 x2 slp x0 mov 0 x2

• SAFETYNET TRACKING BADGE

Hint:We need 2x6 cells to store old value, and 2 cells to store current value, notice that the memory chip has exactly 14 cells.

¥12 COST 460 POWER 27 LINES

teq p0 0 - mov p1 acc - mov p0 dat teq x2 1 - jmp E tgt dat 79 + mov 100 x3 + jmp E mov acc x1 tlt dat 51 - mov x0 null mov x0 x3 E:slp 1

@ mov 50 p1 teq x3 1 + mov x3 acc L:+mov x3 p1 + mov 0 x1 + sub 1 + slp 1 + tgt acc 0 + jmp L mov 50 p1 - teq x3 x2 - mov 0 x1 + mov 1 x1 slp 1

Provide by KoTaM¥13 COST 412 POWER 28 LINES

teq p0 0 + jmp 9 tgt p0 79 + mov 8 x0 + jmp 9 mov p1 x0 tgt p0 50 - mov x1 acc 9: slp 1

slx x2 mov x2 acc mov x1 acc mov x0 x3 mov acc x1

mov 50 p1 1: mov x0 dat tcp dat 1 + teq x0 x2 + mov 0 x1 + jmp 0 - slp 1 - jmp 1 mov x0 acc 8:mov x0 p1 sub 1 0:slp 1 teq acc 0 - jmp 8

AVALON CITY

COLD STORAGE ROBOT [ 18 - 402 - 42 ]

Hint:Send a signal to extend lead the robo-hand to ... extend, send a second signal would retract it again. The graber need 1 tick to grab or release. Mantain a array in the memory chip, find the movement for the hands first.

¥18 COST 402 POWER 42 LINES

tcp x0 1 - jmp E + mov x0 x1 mov 0 x1 + jmp E mov x0 x1 E:slp 1

slx x0 mov x0 acc mov 0 x1 L:teq x2 acc - jmp L mov acc x3 mov x1 x3 mov x1 acc sub 1 mov acc x1 mov x0 acc mov acc x2

mov 50 p1 slx x1 mov x1 dat mov x1 acc teq dat 0 mov acc dat add 1 + mov acc x3 + slp 2 gen p1 dat 0 - mov acc x3 mov 50 p1 slp 2 gen p1 0 dat

slx x0 mov x0 acc gen p1 1 0 mov 100 p0 slp acc mov 100 p1 slp 1 mov 0 p0 mov 0 p1

SCIENTIFIC CHRONOMETER [ 10 - 349 - 24 ]

New Version:I somehow solved this one base on my old solution, just mul 2 to the old solution's result. But the way I do it is not elegance at all. I would like to save my brain for my final exam this semester, so if any one has better solution, please notify me, I would like to add your solution in this site under your name. _(:зゝ∠)_ ¥15 COST 1254 POWER 35 LINES

teq p0 0 + jmp E teq acc 0 + sub 1 + mov 0 x0 E:mov acc x2 - mul -1 teq x2 0 + mov 0 acc slp 1

mov x0 dat teq p0 100 + teq dat -1 - jmp E teq acc 0 + mov -999 x3 + mov 0 dat - mov 0 acc - mov 0 x3 E:teq dat 1 + add 5 + mov acc x3 mov dat x0 slp 1

slx x0 mov x0 acc teq -999 acc + jmp E mov acc dat dgt 1 tgt dat 199 + dst 1 2 - tlt dat 100 - dst 1 1 E:mov acc x2

Old version:My solution can't pass the new test after update, it's only work when all signal come in at even tick. I will rebuilt it later. This is a pretty simple one for a long time. ¥10 COST 394 POWER 24 LINES

teq p0 0 + jmp E teq acc 0 + sub 1 + mov 0 x0 E:mov acc x3 - mul -1 teq x3 0 + mov 0 acc slp 2

slx x0 mov x0 dat teq p0 100 + teq dat -1 - jmp E teq acc 0 + mov -999 x3 + mov 0 dat - mov 0 acc - mov 0 x3 E:mov dat x0 teq dat 1 + add 1 + mov acc x3

AUTOMATIC PET FEEDER [ 22 - 1304 - 50 ]

¥22 COST 1304 POWER 50 LINES

@ mov 99 acc S:slp 1 add 1 mov x1 dat tlt dat 0 + jmp S mov acc x3 mov dat x3 mov dat x0 mov 0 x0 tlt x3 x0 - mov dat x0 - mov 1 x0 - mov acc x0

slx x3 mov x3 acc tcp x3 2 - sub x2 - jmp E + sub x1 + jmp E sub x0 E:mov acc x3

slx x0 mov x0 acc mov acc x3 teq x0 0 + mov x2 x0 - mov x0 x2 - mov acc x1

S:slx x3 tcp x3 2 - mov x2 x3 - jmp S + mov x1 x3 + jmp S mov x0 x3

slx x0 mov x0 acc mov acc x1 sub 1 mov acc dat mov x3 acc dgt dat teq acc 1 + mov x1 p1 - mov x1 p0 slp 1 + mov 0 p1 - mov 0 p0

ELECTRONIC PRACTICE TARGET [ 28 - 1314 - 63 ]

Hint:I calculate a turn number for almost every chip. How to flash the LED would be the critical point of this puzzle.

¥28 COST 1314 POWER 63 LINES

slx x0 mov x0 null mov p0 acc sub 50 mul acc mov acc dat mov p1 acc sub 50 mul acc add dat dgt 2 mov acc x3

E:slx x0 mov x0 dat teq dat 0 + mov 4 x3 + jmp E tlt dat 4 + mov 2 x3 + jmp E tlt dat 9 + mov 1 x3 - mov -2 x3

teq p0 0 + jmp E mov null x0 add 1 mov acc x2 mov x2 null tlt acc 8 E:mov acc x3 - mov 0 acc - slp 7 slp 1

slx x0 mov x0 dat teq dat 1 + mov 8 p1 - teq dat 5 + mov 8 acc add x1 tlt dat 5 + mov acc p0 - mov acc p1 mov null x0

slx x2 mov x2 acc sub 8 mov acc x2

mov x0 dat tgt dat 0 - jmp E teq dat 8 + mov 4 acc L:mov p0 x3 mov x3 x1 mov p1 x3 mov x3 x2 + sub 1 + slp 1 E:slp 1 + tgt acc 0 + jmp L

AQUATIC HARVESTING ROBOT [ 31 - 5737 - 73 ]

Hint:The idea is simple. In each time unit, firstly, add new loction (if we recieved) at the d0 port, Secondly, look through the memery chip, make sure a1 pointer would stop excatly at the first non-zero cell, and pass that non-zero value to next module, if there has no such cell, then ensure a1 pointer would make no movement, and pass the current loction to next module. Thirdly, compare the loction passed by last module with current loction, decide how to move and the new loction. Lastly, check weather the new loction is over-lap a location in memery chip, if so clear that cell and pass 100 to harvest output.

¥31 COST 5737 POWER 73 LINES

mov x0 acc teq acc -999 + jmp E dst 1 x0 mov acc x1 E:mov null x2 slp 1

mov x2 acc L:mov x0 dat tgt dat 0 + mov dat x3 + mov x1 acc + sub 1 + mov acc x1 + jmp E - add 1 - teq acc 14 - jmp L mov p0 x3 E:slp 1

mov x1 dat mov dat acc dgt 0 mov acc x0 mov dat acc dgt 1 mov acc x0 slp 1

mov p0 acc dgt 0 sub x0 mov acc x2 mov acc x3 mov p0 acc dgt 1 sub x0 mov acc x2 mov acc x3 mov x2 x1 mov x1 p1 slp 1

tcp x0 0 mov 50 p1 + mov 0 p1 - mov 100 p1 tcp x0 0 mov 50 p0 + mov 0 p0 - mov 100 p0 slp 1

tcp x0 0 + sub 1 - add 1 tcp x0 0 + sub 10 - add 10 mov null x0 mov acc p0 slp 1

mov x2 acc mov x0 dat L:mov x0 acc tgt p1 0 + teq p1 x1 + mov 100 x2 + mov acc x0 + mov 0 x1 + mov dat x0 + jmp E teq x0 dat - jmp L mov 0 x2 E:slp 1

This is a solution for old version, failed now. But you can still access the old version by level code 3113.Hint:I distribute different assignment for different chips, I use three chip(two big, one small) to calculate the distance from current position to any position that passed into they. notice that the distance d would be max{|x1-x2|, |y1-y2|} instead of (x1-x2)^2+(y1-y2)^2. I use a big chip to store unharvest pos in a memory chip(store it with a sigel value using it 0-digit for x and 1-digit for y), then I go through all the unharvest pos to find the destination by a big chip. Finaly use a big chip to determine the direction. And I still use some more chips to assistant the chips mentioned above.
~~¥41 COST 8335 POWER 108 LINES~~

~~mov x1 acc teq acc -999 + jmp E dst 1 x1 mov 0 x2 L:teq x0 0 - jmp L mov acc dat mov x2 acc sub 1 mov acc x2 mov dat x0 E:mov null x3 slp 1~~

~~tcp x1 0 + sub 1 - add 1 tcp x1 0 + sub 10 - add 10 mov acc p0 slp 1~~

~~mov x2 null mov 0 x1 L:mov x0 acc tcp acc 0 + teq acc p1 + mov x1 acc + sub 1 + mov acc x1 + mov 0 x0 - mov acc x3 E:tlt x1 6 + jmp L mov 0 x3 slp 1~~

~~mov x2 acc dgt 0 mov acc dat mov p0 acc dgt 0 sub dat mov acc x1 mov acc x3 mov p0 acc dst 0 0 sub x2 mov acc x1 mov acc x3 slp 1~~

~~S:slx x0 mov x0 acc teq acc 0 + mov -1 x3 - mov acc x3 - mov acc x2 - dgt 0 - mov acc dat - mov p1 acc - dgt 0 - sub dat - mul acc - mov acc x2~~

~~mov 999 dat mov p0 acc L:teq x3 -1 + jmp E tlt x2 dat + mov x2 dat + mov x3 acc - mov x2 null - mov x3 null jmp L E:mov acc x1 dst 0 0 mov acc x1 slp 1~~

~~slx x0 mov x0 acc teq acc -1 + jmp E mov acc x3 mov x1 x2 mov x1 x2 E:mov acc x3~~

~~tcp x0 0 mov 50 p1 + mov 0 p1 - mov 100 p1 tcp x0 0 mov 50 p0 + mov 0 p0 - mov 100 p0 slp 1~~

~~slx x1 mov x1 acc dgt 1 mov acc dat mov p0 acc dgt 1 sub dat mul acc mov x1 dat tgt dat acc + mov dat x3 + mov dat x3 - mov acc x3 - mov acc x3~~

SUSHI-MAKING ROBOT [ 28 - 1293 - 63 ]

Hint:The table is leaves, the gates are notes, the whole sushi shop is layout as a complete binary tree.

¥28 COST 1293 POWER 63 LINES

mov x1 acc teq acc -999 + jmp E dst 1 x1 mov acc x0 E:mov null x2 slp 1

mov x2 null teq p1 0 + jmp E mov x0 dat teq dat 0 mov x1 acc sub 1 mov acc x1 - mov 0 x0 - mov dat acc - dgt 0 - mov acc x3 - mov dat x3 E:slp 1

mov 50 p0 slx x2 mov x2 acc slp 2 tgt acc 29 + sub 20 + mov 0 p0 - mov 100 p0 slp 1 mov acc x3

@ mov 100 p0 slx x1 mov 0 p0 mov x1 acc mov x1 dat mov 100 p1 slp 1 mov acc x3 mov 30 p1 slp 1 mov 0 p1 slp 1 mov 100 p0 mov dat x2

mov 50 p1 slx x0 mov x0 acc slp 2 tgt acc 19 + mov 0 p1 - mov 100 p1 slp 1

mov 50 p1 slx x0 mov x0 acc slp 2 tgt acc 49 + sub 40 + mov 0 p1 - mov 100 p1 slp 1 mov acc x1

THORIUM REACTOR STATUS MONITOR [ 19 - 5886 - 47 ]

¥19 COST 5886 POWER 47 LINES

slx x0 mov x0 x1

mov -15 x1 mov p0 x1 mov 10 x1 mov 9 x1 mov -25 x1 mov p1 x1 mov 20 x1 mov 19 x1 slp 1

slx x0 mov x0 x3 mov x0 acc mul 5 dgt 2 add x0 mul -1 mov acc x3 mov x0 x3

slx x0 mov x0 acc mov x0 dat A:teq acc dat - mov acc x3 - add 1 - jmp A mov x0 dat mul -1 B:teq acc dat - mov acc x3 - sub 1 - jmp B

@ mov 32 x3 teq p0 100 + mov 30 x3 - mov -30 x3 - teq p0 50 + mov 31 x3 - mov -31 x3 teq p0 0 + mov 34 x3 - mov -34 x3 - teq p0 50 + mov 33 x3 - mov -33 x3 slp 1

BRAIN-COMPUTER INTERFACE [ 22 - 4038 - 44 ]

Hint:Add up the 3-digit value.

¥22 COST 4038 POWER 44 LINES

mov 0 x3 teq p1 100 + mov x0 acc - add x0 mov acc x2 + mov x1 x2 - mov dat acc - add x1 - mov acc x2 - mov x0 acc mov x1 dat slp 1

slx x0 mov x0 dat mov dat acc dgt 0 mov acc x2 mov dat acc dgt 1 mov acc x2 mov dat acc dgt 2 mov acc x2 teq x1 3 + mov null x3

slx x0 mov x0 x3 mov 0 acc A:teq x1 0 - add 1 teq x3 6 - jmp A tgt acc 1 + mov null x2 + mov 100 p1 - mov 0 p1

slx x3 mov x3 x1 mov 0 acc A:teq x0 0 - mov acc x2 add 1 teq x1 6 - jmp A

CELLULAR SCAFFOLD PRINTER [ 27 - 1177 - 64 ]

Hint:Since motors works in a certain pattern. We can do this in a sperated module. Then notice that we can pre-store all the print pattern (except first three, why?), each occupies two cells.

¥27 COST 1177 POWER 64 LINES

S:slx x0 mov x0 acc mul 2 mov acc x2 mov acc x3 mov acc x3 tgt acc -1 + slp 6

S:slx x0 mov x0 p1 teq acc 6 + jmp B A:mov acc x1 add 1 tlt acc 6 + slp 1 + jmp A B:+sub 1 + mov acc x1 + tgt acc 0 + slp 1 + jmp B

S:slx x2 mov x2 acc tlt p1 5 + mov p1 x3 + mov null x3 + jmp S mov p1 x1 tlt acc 3 - sub 3 - mov x0 null mov x0 x3 mov acc x3

S:mov 0 x3 slx x1 mov x1 acc dgt x1 teq acc 0 + mov 0 x3 - mul -5 - add 30 - dgt 1 - mov acc dat - mov 0 acc - dst dat 1 - mov acc x3 slp 1

@ add 100 mov 50 p1 S:slx x0 tgt x0 -1 - nop - jmp S mov acc p1 mul -1 slp 5

mov 50 p1 slx x0 tgt x0 -1 - mov 0 p1 slp 5 + mov 100 p1 slp 1

NEURAL PROCESSOR LOGIC BOARD [ 26 - 2911 - 65 ]

Hint:Store the series no matter wheather they would pass the test. If they pass re-output the series to outputs.

¥26 COST 2911 POWER 65 LINES

mov -1 dat A:mov x0 acc teq acc -999 - mov 0 dat - mov acc x1 - jmp A B:mov x3 acc teq acc -999 - mov 1 dat - mov acc x1 - jmp B mov dat x2 slp 1

dst x0 4 mov acc dat dgt 0 teq acc 4 mov dat acc + mov 100 p1 - mov 0 p1 + sub 5 add 11 tgt acc 49 + mov 100 p0 - mov 0 p0 + sub 50 slp 1

slx x3 mov 0 acc L:mov x3 dat mov dat x0 sub dat mov x3 dat mov dat x0 add dat teq x2 12 - jmp L mov x3 dat teq dat acc + mov dat x1

mov 0 x3 slx x1 L:mov x1 acc dst 1 x1 mov acc x2 teq x3 12 - jmp L

slx x1 mov null x3 L:mov x3 acc teq x2 12 dgt 0 mov acc x0 mov x3 x0 - jmp L mov x1 x0

mov 0 x1 slx x0 mov x0 null L:mov x3 acc mov acc x0 dgt 1 mov acc x0 teq x1 12 - jmp L

CHEERS!!!!!!!!!!!

CHEERS!!!! ( ゜v ゜)つロ Finally, I have clear all levels include secret puzzle. But the game is still far way from over. I will continue optimize the solution. I may give more detial descriptions for my solutions which may make them more readable.

SHENZHEN I/O TRAILER [ 13 - 769 - 30 ]

Thanks ShadowCluster for telling me where to find the access code. Go check the achievement icon!

¥13 Cost 769 Power 30 Lines