SHENZHEN I/O

SHENZHEN I/O

46 arvostelua
UNKNOWN PACKET SIZE
   
Palkinto
Lisää suosikkeihin
Lisätty suosikkeihin
Poista suosikeista
Tiedostokoko
Julkaistu
1.127 KB
30.11.2016 klo 21.11
1 muutos ( näytä )

Tilaa ladataksesi
UNKNOWN PACKET SIZE

Kuvaus
Those pesky blocking xbus inputs!

Not much of a difficult puzzle, but may be interesting nonetheless.
25 kommenttia
krtn 8.10.2024 klo 4.49 
my best. 10/433/14
s7eph4n 5.3.2024 klo 11.24 
Double checked my solution after recent posts here. Discovered that I had two unnecessary instructions. Removed those and surprisingly everything still runs smoothly. Improved to a 10/445/12
Genhis 1.3.2024 klo 16.18 
What an annoying puzzle. :steamhappy: 10/445/13
CN- 2.1.2023 klo 5.43 
13|1040|20 and this is definitely not the way you suppose... I failed to figure out the way to find packet end, so I made a "clock thing" to generate packet end signal. Maybe I have to solve this another day.
Verdammte Heinz 30.12.2021 klo 9.40 
Nice puzzle, got 10|848|16, and 748 power with another solution, but that one takes two MC6000. Not sure yet where I can shave off those 2 instructions to reach 14
s7eph4n 14.10.2021 klo 14.30 
I went to the following phases:
- ez pz lemon squeezy
- wait a minute, y u no stop?
- impossibru!
- brain.exe stopped working
- holy moly ... yes ... that should work
- I need only ONE more line
- ok, restructure ... optimize
- yes ... Yes ... YES
- GOT IT ... 10/544/14
- noice one, like very much

Good job. Thx for that.
jek777 24.6.2021 klo 2.13 
Fun and different kind of problem (compare to builtin levels at least, this is my first workshop one). Got 10/962/17 for those who care. ( I haven't really tried optimizing, I mostly enjoy just solving the task, with few components, but don't care much for power or lines, there is enough optimising needed just to fit the lines in the processors :-) )
harry 3.6.2021 klo 22.00 
haha, excellent idea
Smoke Fumus 24.9.2020 klo 14.44 
@DarkRedman666 You can use other methods of signalling. Such as reading if array value has changed in a loop. Come on, it's not that hard.
Eisenhorn 20.10.2019 klo 11.20 
Cool! My result: 10|557|14. I can optimize a little more, but laziness :lunar2019piginablanket: