TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Viennese Mazes: What They Are, and How to Make One

95 点作者 bbotond大约 11 年前

4 条评论

jamis大约 11 年前
I love the idea of constrained mazes like this. Another related idea is that of &quot;plank puzzles&quot; (<a href="http://www.clickmazes.com/planks/ixplanks.htm" rel="nofollow">http:&#x2F;&#x2F;www.clickmazes.com&#x2F;planks&#x2F;ixplanks.htm</a>), which constrain available moves based on which planks you currently have access to.
BWStearns大约 11 年前
Very cool puzzles and nice to share the code.<p>One thing about the example mazes&#x2F;solutions. On the hard one, isn&#x27;t tqp-khe-bdc-a a faster solution to the hard one listed?&#x2F;Doesn&#x27;t going t-r first violate the red light rule?
评论 #7708712 未加载
RBerenguel大约 11 年前
Sounds very similar to logic mazes (classic example for me is Theseus and the Minotaur)
评论 #7708144 未加载
judk大约 11 年前
One of the example solutions breaks the rule of &quot;only pass a light once&quot;
评论 #7716497 未加载