Can I get examples of Games that have a recursive solution (ie Towers of Hanoi)

Question

1.00/5 (2 votes)

See more:

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

Posted 15-Apr-14 12:42pm

Cesar Reyes Sencion

Add a Solution

Comments

Sergey Alexandrovich Kryukov 15-Apr-14 18:48pm

Do you have such ideas yourself? How about sharing them?
I must warn you: many people having such ideas will rather seek ways to use them themselves before they share them with your. Some ideas like that costs millions. :-)
—SA

Cesar Reyes Sencion 15-Apr-14 18:50pm

I think you misunderstand. I am asking for games that can be done recursively, other than Towers of Hanoi. I need to do one's Recursive Solution for a school homework.

Sergey Alexandrovich Kryukov 15-Apr-14 18:54pm

No, I understood you perfectly. I explained why people would not likely share those ideas.
I have a better idea for you, my Solution 1. I already see interesting books on the subject.
—SA

Cesar Reyes Sencion 15-Apr-14 18:57pm

Correct, but there are some recursive games whose solution is known/open-source worldwide (Ie: There are a few Mine sweepers solutions done recursively on the net). I'm asking if there's any outside of these 2 that I could get my hands, on, to be more specific.

Sergey Alexandrovich Kryukov 15-Apr-14 18:59pm

I know, I know. I perfectly understood it exactly this way in first place, no need to repeat. Really, use my advice in Solution 1.
—SA

Sergey Alexandrovich Kryukov 15-Apr-14 19:07pm

Okay, see the update to the answer, after [EDIT]. It should be enough for you to start.
Hope you will accept my solution formally (green "Accept" button).
Good luck.
—SA

Cesar Reyes Sencion 15-Apr-14 19:09pm

My bad! I should've scrolled down to the Solution you posted. Thanks for the last 2 links

Sergey Alexandrovich Kryukov 15-Apr-14 19:11pm

No problem at all — you are welcome.
Good luck, call again.
—SA

Sergey Alexandrovich Kryukov 15-Apr-14 19:02pm

By the way, some Rubic cube algorithms are based on recursion, but 1) they are not very efficient, 2) overall solution is too complicated, with big parts not related to recursion.
Could be game of 15... And a lot more.
—SA

Sergey Alexandrovich Kryukov 15-Apr-14 18:49pm

By the way, Towers of Hanoi has a very simple non-recursive solution...
—SA

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Sergey Alexandrovich Kryukov · Accepted Answer · 2014-04-15T12:53:00

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[^].

[EDIT]

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