#Shift Efficiency
16 messages · Page 1 of 1 (latest)
No, you can do a whole lot better than that, but it would require quite a bit more room than this.
care to give hints, perhaps?
Do you recall the level "Double the Number"?
- ||What have you done in the level
Double the number?|| - ||You effectively have ~2x the number of nescessary
1-bit switches (assuming that you break up each8-bit one)||
Instead of ||8 shifters each shifting by 0, 1, 2, 3, 4, ..., 7, can you do it with fewer||?
And there is less delay in the circuits that both me & Gelthor are suggesting.
ooh
||I can use each bit to determine if I have a 1 bit shift, 2 bit shift and 4 bit shift||
All that said, as a general rule we recommend progressing the level map rather than optimising them before you unlock the scoring mechanic, which provides metrics and a useful tool.
I was just curious since all the other levels I did had more elegant solutions while this one felt
extremely brute forcy
which threw me off
i just used muxes, splitters, and mergers for some reason. might try optimizing mine to the max bc bored
Knowing that multiplying by 2 is just a bit shift is impressive, but knowing that a bit shift is multiplying by 2 is not something I have ever seen