Butikssida
SHENZHEN I/O
Alla Diskussioner Skärmbilder Konst Sändningar Filmer Workshop Nyheter Guider Recensioner

SHENZHEN I/O

Butikssida
SHENZHEN I/O >  Workshop > Pytatos workshop
Otillräckligt med betyg
3RD PARTY Y-NET SWITCH
Beskrivning Diskussioner0 Kommentarer3 Ändringar
   
Utmärkelse
Favorit
Favoritmarkerad
Avfavoritmarkerad
Filstorlek
Lades upp
Uppdaterades
10.493 KB
4 aug, 2018 @ 5:57
4 aug, 2018 @ 6:14
2 ändringsnotiser ( visa )
Skapat av
Pytato
Offline
156 Unika besökare
65 Nuvarande abonnemang
0 Nuvarande favoriter

Abonnera för att ladda ner
3RD PARTY Y-NET SWITCH

Beskrivning
"""
We have been contracted by the state owned electronics group: Xingyang Semiconductor Co., Ltd. to produce a third party interface for GwynnTech's new secure network standard: Y-Net. This contract will give us an important foothold in the internet technology market and will hopefully open up further opportunities.

This packet "switch" behaves much like the routers of old - likely making it very hard for new age hackers to understand, it reads the address of the packet supplied to it on one end, checks for errors and passes the data of the packet (sans address) on to the corresponding device. This unit operates on even parity (excluding the address, maybe that's a special feature of Y-Net) and has protocols in place to deal with corrupt packets.

It is understood that as Y-Net is a very new network technology, we should expect a large number of corrupted packets, please ensure your solution is fit to deal with all of these. For further information, see the brief enclosed.
"""

Had a lot of fun making this one, it's a shame that the timeline makes XBus spam look so ugly (but I wanted to fit in all those test cases). If anybody is interested I can post my pretty awful looking solution. Have fun :D.

For reference, my solution was: ¥35/3156P/87L.
3 kommentarer
< >
Pytato  [skapare] 5 aug, 2018 @ 15:37 
Wow, my first version of the puzzle shipped the bits in pairs but I couldn't come up with a solution for that (I'm not very good at this game), so it had to be individual bits. I guess with the efficiency of your solution it would be relatively easy to split each packet of data to handle parity checks (that was the major problem with paired bits).

Thanks for playing my puzzle :)
pv2b 5 aug, 2018 @ 2:17 
After a little more optimization I was able to get it down to 18/1798/42 . I think that's the lowest reachable cost, at least in my limited imagination.
pv2b 4 aug, 2018 @ 11:17 
Nice puzzle. I was able to do 22/1997/37 or 21/2146/42 .