blocks|key|6450346|text|603:25|type|header-two|depth|inlineStyleRanges|entityRanges|data|6450347|📷|atomic|offset|length|6450348|在线测试|unstyled|6450349|今天我重新阅读了“制造商”的问题，突然想到了一个能大大减缓这个过程的想法:新的程序不再只有50个值和三次改变颜色，而是这样做，但在那之后，它会将值的数量减少1，然后再进行颜色的改变，直到程序停止的时候有一个空的磁带。|6450350|队列一次不会存储超过50个值，因此尝试将太多值推送到磁带上是没有用的--它们只是被立即推开。像以前一样，传送带的目的是最大限度地延长物体运行所需的时间。事实上，为了实现运行时间的大幅度增加，已经进行了很小的调整。|6450351|不过，离面包箱的回答还很远。|entityMap|0|IMAGE|mutability|IMMUTABLE|imageUrl|https://i.stack.imgur.com/VSfq6.jpg|imageAlt|1|LINK|MUTABLE|url|http://pleasingfungus.com/Manufactoria/?lvl=32&code=g12:5f2;g13:5f1;g13:4f2;g14:4f2;g15:4f3;g15:5f0;g14:5f3;g14:6f2;g15:6f3;c15:7f3;c15:8f0;c14:8f3;c14:9f2;c15:9f3;c15:10f0;c14:10f0;c13:10f1;c13:9f1;c13:8f1;i13:7f3;c13:6f0;c12:6f0;q10:6f4;y10:5f0;y9:5f1;y9:4f2;y10:4f2;y11:4f3;y11:5f3;r10:7f2;c12:7f2;c14:7f2;i11:6f1;c9:6f3;c9:7f3;c9:8f3;c9:9f2;p10:9f2;b10:8f2;y10:10f0;c9:10f1;q11:9f7;c11:10f2;c12:9f1;c11:7f3;c11:8f2;c12:8f1;&ctm=Slow_Accepter!;Generate_the_slowest_possible_accepting_machine;:;7;3;0;|2|https://codegolf.stackexchange.com/a/12069/7911^0|0|0|1|0|0|0|4|1|0|0|0|4|6|2^^$0|@$1|2|3|4|5|6|7|14|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|15|8|@]|9|@$E|16|F|17|1|18]]|A|$]]|$1|G|3|H|5|I|7|19|8|@]|9|@$E|1A|F|1B|1|1C]]|A|$]]|$1|J|3|K|5|I|7|1D|8|@]|9|@]|A|$]]|$1|L|3|M|5|I|7|1E|8|@]|9|@]|A|$]]|$1|N|3|O|5|I|7|1F|8|@]|9|@$E|1G|F|1H|1|1I]]|A|$]]]|P|$Q|$5|R|S|T|A|$U|V|W|-4]]|X|$5|Y|S|Z|A|$10|11]]|12|$5|Y|S|Z|A|$10|13]]]]

<h2>603:25</h2>

<img src="https://i.stack.imgur.com/VSfq6.jpg" alt="">

<a href="http://pleasingfungus.com/Manufactoria/?lvl=32&amp;code=g12:5f2;g13:5f1;g13:4f2;g14:4f2;g15:4f3;g15:5f0;g14:5f3;g14:6f2;g15:6f3;c15:7f3;c15:8f0;c14:8f3;c14:9f2;c15:9f3;c15:10f0;c14:10f0;c13:10f1;c13:9f1;c13:8f1;i13:7f3;c13:6f0;c12:6f0;q10:6f4;y10:5f0;y9:5f1;y9:4f2;y10:4f2;y11:4f3;y11:5f3;r10:7f2;c12:7f2;c14:7f2;i11:6f1;c9:6f3;c9:7f3;c9:8f3;c9:9f2;p10:9f2;b10:8f2;y10:10f0;c9:10f1;q11:9f7;c11:10f2;c12:9f1;c11:7f3;c11:8f2;c12:8f1;&amp;ctm=Slow_Accepter!;Generate_the_slowest_possible_accepting_machine;:;7;3;0;" rel="nofollow noreferrer">Online test</a>

I was re-reading through the Manufactoria questions today, and suddenly had an idea which would dramatically slow down the process: instead of just having 50 values and changing colours 3 times, the new program does that, but then after that, it decrements the number of values by 1, and goes through the colour-changing again, until there is an empty tape at which time the program stops.

The queue won't store any more than 50 values at one time, so there's no use trying to push too many values onto the tape - they just get pushed off straight away. As before, the conveyor belts aim to maximise the time taken for the thing to run. In fact, there was minimal tweaking down to achieve a tremendous increase in run-time.

Still nowhere near <a href="https://codegolf.stackexchange.com/a/12069/7911">breadbox's answer</a> though.

blocks|key|6450431|text|33:33|type|header-two|depth|inlineStyleRanges|entityRanges|data|6450432|在这方面工作了很长一段时间(波动率把标准设得很高)，但一旦我达到33:33，我认为这是一个很好的时间停下来。|unstyled|offset|length|6450433|策略相当直截了当:基本上用一种颜色填充磁带，然后再用另一种颜色填充磁带，并且总是尝试在每次写(或一组写)之间遍历尽可能多的单元格。|6450434|我相信我们可以找到更多的方法来解决这个问题。|6450435|📷|atomic|6450436|水平链路|entityMap|0|LINK|mutability|MUTABLE|url|https://codegolf.stackexchange.com/a/12048/1700|1|IMAGE|IMMUTABLE|imageUrl|https://i.stack.imgur.com/3zVsq.png|imageAlt|2|http://pleasingfungus.com/Manufactoria/?lvl=37&code=b15:5f3;b15:6f3;b15:7f3;c14:9f1;c14:8f1;c14:7f1;c14:6f0;c13:6f0;c12:6f0;c11:6f0;p10:6f0;r10:5f2;r11:5f1;r11:4f0;r10:4f0;r9:5f3;c9:6f3;c9:7f3;c9:8f2;i10:8f7;i12:8f7;c13:10f2;y10:7f3;y10:10f0;c9:10f1;c9:9f1;q11:8f6;r9:4f3;p12:7f2;b13:7f3;c11:7f2;b15:4f3;c13:8f3;c13:9f3;g12:9f0;i10:9f1;i11:9f1;c11:10f2;b14:4f2;b13:4f2;b13:5f1;b12:5f2;c15:10f1;c15:9f0;b15:8f0;c14:10f2;&ctm=Code_Golf;Busy_Beaver;:*;7;3;0;^0|0|E|3|0|0|0|0|0|1|1|0|0|4|2^^$0|@$1|2|3|4|5|6|7|14|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|15|8|@]|9|@$E|16|F|17|1|18]]|A|$]]|$1|G|3|H|5|D|7|19|8|@]|9|@]|A|$]]|$1|I|3|J|5|D|7|1A|8|@]|9|@]|A|$]]|$1|K|3|L|5|M|7|1B|8|@]|9|@$E|1C|F|1D|1|1E]]|A|$]]|$1|N|3|O|5|D|7|1F|8|@]|9|@$E|1G|F|1H|1|1I]]|A|$]]]|P|$Q|$5|R|S|T|A|$U|V]]|W|$5|X|S|Y|A|$Z|10|11|-4]]|12|$5|R|S|T|A|$U|13]]]]

<h1>33:33</h1>

Worked on this for quite a while (<a href="https://codegolf.stackexchange.com/a/12048/1700">Volatility</a> set the bar pretty high), but once I hit 33:33, I thought it was a neat time to stop at. 

The strategy is pretty blunt: basically fill up the tape with one colour, then another, then another, and always try to traverse as many cells as possible between each write (or group of writes).

I'm sure there are ways to be found that we can go a lot further with this.

<img src="https://i.stack.imgur.com/3zVsq.png" alt="Busy Beaver">

<a href="http://pleasingfungus.com/Manufactoria/?lvl=37&amp;code=b15:5f3;b15:6f3;b15:7f3;c14:9f1;c14:8f1;c14:7f1;c14:6f0;c13:6f0;c12:6f0;c11:6f0;p10:6f0;r10:5f2;r11:5f1;r11:4f0;r10:4f0;r9:5f3;c9:6f3;c9:7f3;c9:8f2;i10:8f7;i12:8f7;c13:10f2;y10:7f3;y10:10f0;c9:10f1;c9:9f1;q11:8f6;r9:4f3;p12:7f2;b13:7f3;c11:7f2;b15:4f3;c13:8f3;c13:9f3;g12:9f0;i10:9f1;i11:9f1;c11:10f2;b14:4f2;b13:4f2;b13:5f1;b12:5f2;c15:10f1;c15:9f0;b15:8f0;c14:10f2;&amp;ctm=Code_Golf;Busy_Beaver;:*;7;3;0;" rel="nofollow noreferrer">Level link</a>

Write a <a href="http://pleasingfungus.com/Manufactoria/" rel="noreferrer">Manufactoria</a> program that will accept the empty input tape. But don't do it quickly! I mean, write the program quickly, but don't let it run quickly. The slower the program, the better, as long as it terminates eventually. The example program below takes 3:51 (the "total time" reported by the simulator).

<img src="https://i.stack.imgur.com/7RDeH.png" alt="enter image description here">

<a href="http://pleasingfungus.com/Manufactoria/?lvl=36&amp;code=g12:5f3;r9:8f1;p12:9f3;c13:9f0;r11:9f0;r10:9f0;r9:9f1;b11:8f0;b10:8f1;r9:7f2;c10:7f2;c11:7f2;c12:7f3;q12:8f3;y13:8f2;y14:8f2;y15:8f1;y15:7f0;y14:7f0;y13:7f0;g12:6f3;&amp;ctm=Slow_Accepter!;Generate_the_slowest_possible_accepting_machine;:;7;3;0" rel="noreferrer">http://pleasingfungus.com/Manufactoria/?lvl=36&amp;code=g12:5f3;r9:8f1;p12:9f3;c13:9f0;r11:9f0;r10:9f0;r9:9f1;b11:8f0;b10:8f1;r9:7f2;c10:7f2;c11:7f2;c12:7f3;q12:8f3;y13:8f2;y14:8f2;y15:8f1;y15:7f0;y14:7f0;y13:7f0;g12:6f3;&amp;ctm=Slow_Accepter!;Generate_the_slowest_possible_accepting_machine;:;7;3;0</a>;

Your program starts with the empty tape. It must doodle around a bit, but eventually reach the output square. You may leave data on the tape if you wish. The slowest program on the 7x7 Manufactoria board wins!

Your right arrow key is your friend, it speeds up the simulator.

Bonus points for crashing the simulator!

Manufactoria: generate the slowest possible accepting program

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

教程

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云智能顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

EdgeOne AI 安全实战专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

聚焦“写作效率、视觉美观与运行性能”三方面进行全面升级，为您提供更高效、稳定的创作环境

社区富文本&Markdown编辑器全新改版上线，欢迎大家体验!

诚挚邀请您参与本次调研，分享您的真实使用感受与建议。您的反馈至关重要，感谢您的支持与参与！

社区新版编辑器体验调研

编写一个接受空输入磁带的制造商程序。但别这么快！我的意思是，快写程序，但不要让它运行得太快。程序越慢，越好，只要它最终终止。下面的示例程序需要3:51 (模拟器报告的“总时间”)。📷http://pleasingfungus.com/Manufactoria/?lvl=36&code=g12:5f3;r9:8f1;p12:9f3;c13:9f0;r11:9f0;r10:9f0;r9:9f1;b1

问制造商:生成最慢的接受程序
EN

回答 2

Code Golf用户

603:25

Code Golf用户

33:33

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问制造商:生成最慢的接受程序EN

回答 2

Code Golf用户

603:25

Code Golf用户

33:33

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问制造商:生成最慢的接受程序
EN