SHENZHEN I/O

SHENZHEN I/O

评价数不足
PRIME FACTOR CALCULATOR
   
奖励
收藏
已收藏
取消收藏
文件大小
发表于
5.261 KB
2016 年 11 月 29 日 下午 1:09
1 项改动说明 ( 查看 )

订阅以下载
PRIME FACTOR CALCULATOR

描述
A Shenzhen I/O version of the classic TIS-100 puzzle. Find out whether it's easier or harder to divide in Shenzhen I/O than in TIS-100!
10 条留言
Feather Sound 2021 年 4 月 24 日 下午 10:41 
26 / 783 / 54 is my best. I've probably spent more time on this than on any of the official puzzles.
ebik 2018 年 10 月 5 日 下午 2:41 
Ok, after one week, I got also under 1k power: 32/993/62. Key idea is to consider what inputs are possible for next part, e.g, when doing division by 5, you do not need to consider even inputs, because you already did division by 2 earlier this way you should have plenty room to optimize hot paths.
cirdec 2018 年 6 月 5 日 上午 12:39 
I've been having fun with this puzzle. My first solution was 12 / 30.9k / 24 lines. I added a division algorithm for 2s in front of it and got it down to 24 / 12.5k / 51 lines. I split out the trial division for 3s and 7s and wrote a special MC6000 division by 5 chip and got it down to 33 / 5.2k / 77.

962 power is impressive.
pv2b 2016 年 12 月 5 日 上午 10:32 
Low power version: 31 / 962 / 54 :-)

Zach should put logarithmic scales on histograms in for puzzles like this...
steve-0 2016 年 12 月 1 日 下午 12:03 
GOOD
Daedamid 2016 年 11 月 30 日 下午 5:32 
Got rid of my super NOP and cleaned up my traces, now I'm sitting at
$13 / 30k power / 35 lines
AlexMBrennan 2016 年 11 月 30 日 上午 5:31 
I got $16/38.5k power/38 lines
Daedamid 2016 年 11 月 29 日 下午 8:26 
Well, I solved it. Went with a really bad design choice, dividing by an incrementing number with a super NOP that stalled for 372 commands because I was 1 line short on a MC6000.

15 cost / 208k power / 40 lines
I feel weirdly proud of this toaster

My other almost solved on would be around this, I just needed a bigger RAM chip.
12 cost / 4k power / 27 lines
Daedamid 2016 年 11 月 29 日 下午 7:38 
Wow, as someone who's never worked with prime numbers before or even played TIS-100 this is quite the challenge for me. I feel like there is a more elegant way to do this, I can divide, it just take a chunk of power. I'm close to solving it, I just need some more RAM to store prime numbers.
stellatedHexahedron 2016 年 11 月 29 日 下午 7:06 
Augh, beaten to the punch!