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

科技回声

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

GitHubTwitter

首页

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

资源链接

HackerNews API原版 HackerNewsNext.js

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

Angel Problem

128 点作者 lukas大约 9 年前

5 条评论

nemo1618大约 9 年前
This is the 1-Angel Problem on a hexagonal grid, yes? <a href="http:&#x2F;&#x2F;llerrah.com&#x2F;cattrap.htm" rel="nofollow">http:&#x2F;&#x2F;llerrah.com&#x2F;cattrap.htm</a><p>Surprisingly tricky, even with a 1-angel!
评论 #11538100 未加载
评论 #11537911 未加载
评论 #11540523 未加载
评论 #11537913 未加载
评论 #11541202 未加载
vessenes大约 9 年前
Mathé&#x27;s 2-Angel proof is really nice, or at least the summary is appealing -- he imagines a &#x27;nice&#x27; devil, shows it can be beaten, then proves that if you can beat the nice devil, you can beat the mean one.<p>This is one of my favorite problem solving strategies -- reducing to a more obvious solvable situation, then filling in the chinks and gaps to expand back.
评论 #11537293 未加载
Kiro大约 9 年前
If the board is infinite, can&#x27;t the angel just jump in one direction forever?
评论 #11537371 未加载
评论 #11537349 未加载
wodenokoto大约 9 年前
From the Wikipedia description it is bit vague how many blocks the devil put down each turn. Is it just 1? The same as angels power?
评论 #11541228 未加载
评论 #11538242 未加载
mondoshawan大约 9 年前
Amusingly, a variant of this is present in Beyond Zork toward the end of the game.