StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
text
Body
copied!<p>This is at a very very high level for a high school student. You should send this as a resume to go work at google or something. Even the use of TeX is impressive.</p> <p>I think the issue lies in the fact that you don't take into account the third rule in that a big disk can't go on a smaller one.</p> <p>Taken from this site: <a href="http://www.cut-the-knot.org/recurrence/hanoi.shtml" rel="nofollow">http://www.cut-the-knot.org/recurrence/hanoi.shtml</a></p> <blockquote> <p>The recursive solution above involves moving twice (N - 1) disks from one peg to another and making one additional move in between. It then follows that</p> <p>TN ≤ TN-1 + 1 + TN-1 = 2TN-1 + 1</p> </blockquote> <p>The traditional explanation of the problem is well defined and states that we can't simply rebuild the tower upside down on another peg and the the right way up on yet another. Mainly because it violates the rule of not having a big disk on top of a small one.</p> <p>Essentially the quickest way to solve it involves each disk being moved at least twice.</p> <p>Unfortunately commutativity of addition doesn't enforce any ordering constraints on the set of disks, so it is possible for a big disk to go on top of a little one.</p> <p>That being said I am just a software engineer and it has been a few years since I have done comp-sci or maths. So you should get a second opinion.</p> <p>You have set this up on a website, keep your paper copyrighted and perhaps email a professor in computer science a link to your site. </p> <p>Also, if you aren't aware there is this field of computer science you might be interested in: <a href="http://en.wikipedia.org/wiki/List_of_unsolved_problems_in_computer_science" rel="nofollow">http://en.wikipedia.org/wiki/List_of_unsolved_problems_in_computer_science</a></p> <p>Don't get dis-heartened by anything I have said here, you are lightyears ahead of where I was in highschool and I am sure you will go places in the academic world. Send links to your site around the place, seek feedback and keep finding ways to improve your understanding of maths.</p> <p>Also, check out topcoder.com - there is an algorist section there that might interest you as well. Also their forums might offer better feedback then I have.</p>

Querying!

Guidance

An individual column

Larger individual text columns get their own page to allow for proper reading.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload