我可以获得具有递归解决方案的游戏示例(即河内之塔) [英] Can I get examples of Games that have a recursive solution (ie Towers of Hanoi)

查看:80
本文介绍了我可以获得具有递归解决方案的游戏示例(即河内之塔)的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!

问题描述

标题是什么。我需要关于哪些游戏除了河内塔(和扫雷)之外还有递归解决方案的想法。

What the title says. I need ideas as to what games have a recursive solution other than Towers of Hanoi (And minesweeper).

推荐答案

请参阅我对该问题的评论。这只是您的请求可能效率不高的一个原因。



另一个原因是:让我们假设你的问题会在成员之间产生热烈的想法竞争(我怀疑它会发生,但让我们假设它)。你觉得如何获得好成绩需要多少时间?我会预测它很多。一个谜题真的非常难以发明。



所以,你可能会做得更好: http://bit.ly/1evBK3g [ ^ ] 。







这样做效果更好:http://bit.ly/1evE4Y1 [ ^ (谜题,而不是游戏)。



我刚从童年时刻回忆起一个特定的谜题:http://en.wikipedia.org/wiki/Baguenaudier [ ^ ]。



我使用了底部图片中显示的表格。但是你需要将它正式化,如果没有手中的玩具,这很难做到。实际上,除了纯粹的递归之外,整个过程都很少。



[结束编辑]



祝你好运,

-SA
Please see my comments to the question. This is just one reason why your request might be not very efficient.

One other reason is this: let's assume for a minute that your question will create an enthusiastic competition of ideas among members (I doubt it can happen, but let's assume it). How do you think much time it will take to get good results? I'll predict it as "a lot". A puzzle is really, really hard to invent.

So, you might be much better of doing this: http://bit.ly/1evBK3g[^].



This works out even better: http://bit.ly/1evE4Y1[^] ("puzzles", not "games").

And I just recalled one specific puzzle from my childhood: http://en.wikipedia.org/wiki/Baguenaudier[^].

I used the form shown on the bottom picture. But you would need to formalize it, which can be hard to do without having the toy in your hands. Actually, the whole process have little except pure recursion.

[END EDIT]

Good luck,
—SA


这篇关于我可以获得具有递归解决方案的游戏示例(即河内之塔)的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!

查看全文
登录 关闭
扫码关注1秒登录
发送“验证码”获取 | 15天全站免登陆