商店頁面
Opus Magnum
全部 討論區 螢幕擷圖 藝術作品 實況直播 影片 工作坊 新聞 指南 評論

Opus Magnum

商店頁面
Opus Magnum >  工作坊 > armin.rigo 的工作坊
41 次評價
INFORMATION AGE
介紹 討論區0 留言23 更新註記
2
   
獎勵
加入最愛
已加入最愛
移除最愛
檔案大小
發佈於
1.613 KB
2018 年 5 月 28 日 下午 2:20
1 項更新註記 （檢視）
建立者
armin.rigo
離線
檢視收藏（可能設為隱藏）
5,185 不重複訪客人數
1,138 目前訂閱人數
21 目前最愛人數

訂閱以下載
INFORMATION AGE

描述
Make a very long chain of various metals. The basic materials are the classic ones, but the problem is to know exactly which kind of metal to put where. This information is encoded inside another very long reagent, of the same length. The number of Air atoms over each Salt atom is equal to the number of times the Lead must be transmuted.

Yes I know the information could in theory be re-encoded in the instructions, but the length makes it impractical. If tempted, imagine that this length is not 42 but 250. The puzzle is actually generated by a Python script picking random numbers. I tried with lengths greater than 42 at first, but it takes too long to run the puzzle to completion...
23 則留言
< >
学习笨蛋症 4 月 16 日 上午 2:09 
The discovery of the solution is inspiring and interesting, but the time to verify the solution is extremely long.
garr890354839 2022 年 10 月 13 日 下午 3:25 
@emlun I figured out a method that just sets up for up to 5 extra atoms up top. The fact that they are air atoms makes no difference, I just make it deal with the potential 5 atoms, then discard what is left.
Haxton 2021 年 12 月 18 日 下午 6:20 
Full throughput: 620/2577/473 [imgur.com]
emlun 2021 年 8 月 30 日 下午 4:56 
Very cool puzzle! I might take some inspiration from this to make something similar...

My first (successful) attempt clocks in at 480G / 4292C / 1895A but cheats a bit by discarding the reagents into an infinite chain after reading them.

@garr890354839 Think about if there's something you can do that behaves differently depending on whether there's an atom present or not.
garr890354839 2021 年 1 月 12 日 下午 8:41 
How do you not hard-code something like this?
sirenhound 2020 年 7 月 12 日 上午 4:26 
I got the general case down to 555/4561/424 https://i.imgur.com/r6T1emq.gifv
Then I improved it to make a tighter gif 570/4553/418 https://i.imgur.com/cU61fwL.gifv
Then I figured I could save money by ditching the obliterator and going with an infinite tail.
I saved 40g but paid for it with a huge increase in area (and huge decrease in frame rate)
530/4553/1309
Dendrite 2020 年 6 月 22 日 上午 10:53 
@armin.rigo yeah, I found an alternative editor on github, that worked.
armin.rigo  [作者] 2020 年 6 月 22 日 上午 1:40 
@FractalusRex: in general, using the "ompuzzle" web editor. In this case, it's a custom Python script that produces the puzzle file directly: https://gist.github.com/arigo/cc4c014d473e4621293094801ce67f8c
Dendrite 2020 年 6 月 21 日 下午 2:01 
Looks interesting.

One question though, how do you get the product requirement and the reagent to be that large? The editor only allows up to a width of 9, right?
Hoshtog Swog 2020 年 6 月 11 日 上午 5:09 
I got it 430/9628/539 for arbitrary inputs, and 175/1504/59 by cheating and hard-coding it, I love this puzzle!
Genuine. [cdn.discordapp.com]
Cheating [cdn.discordapp.com]