tag:blogger.com,1999:blog-1756432593380603974.comments2014-05-20T03:24:15.416-07:00Intelligence In GamingAshokahttp://www.blogger.com/profile/04703466415906876075noreply@blogger.comBlogger10125tag:blogger.com,1999:blog-1756432593380603974.post-22379320080913205332014-05-20T03:24:15.416-07:002014-05-20T03:24:15.416-07:00This is the game of intelligence thanks for sharin...This is the game of intelligence thanks for sharing this blog...<br /><br /><a href="http://www.truemuslims.net/" rel="nofollow">mp3 quran</a><br />akram ismailhttps://www.blogger.com/profile/06490624469959389196noreply@blogger.comtag:blogger.com,1999:blog-1756432593380603974.post-80153177517760939372014-03-28T05:23:46.069-07:002014-03-28T05:23:46.069-07:00Maakali Packers & Movers is a Cargo Packers an...Maakali Packers & Movers is a Cargo Packers and Movers in Lucknow, providing packers movers services, professional warehousing services, goods moving services, corporate relocation services, loading unloading services.<br /><br /><a href="http://justgivecall.com/maakalidetail.php?tab=suppliers&id=9" rel="nofollow">Mr.S S Mishra</a><br /><br /><a href="http://justgivecall.com/maakalidetail.php?tab=suppliers&id=9" rel="nofollow">Maakali packers movers and transportation</a>Jacob Martinhttps://www.blogger.com/profile/00378294834955414140noreply@blogger.comtag:blogger.com,1999:blog-1756432593380603974.post-35545578323755164912014-02-20T00:22:32.287-08:002014-02-20T00:22:32.287-08:00Still i found the problems in my gaming software.....Still i found the problems in my gaming software...<br /><br /><br /><br /><a href="http://www.blazingsoftech.com/portfolio.html" rel="nofollow">Software Development Company in Lucknow</a>Blazingsoftechhttps://www.blogger.com/profile/12114040676727156134noreply@blogger.comtag:blogger.com,1999:blog-1756432593380603974.post-80390916014914436962013-09-17T04:37:58.546-07:002013-09-17T04:37:58.546-07:00Live dealer casino the best games for players.<a href="http://www.bestlivedealercasino.net/" rel="nofollow">Live dealer casino</a> the best games for players.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-1756432593380603974.post-16870829880435208872012-10-05T04:10:30.415-07:002012-10-05T04:10:30.415-07:00This is nice coding for the game tower of hanoi i ...This is nice coding for the game tower of hanoi i really like to play games i am a game lover and this blog is very nice i am happy with the description thank you so much for sharing...<br /><br /><br /><a href="http://www.microsoftpromotionalcode.com/" rel="nofollow">Microsoft Office Promo Code</a><br />Emily Watsonhttps://www.blogger.com/profile/08808474650771941471noreply@blogger.comtag:blogger.com,1999:blog-1756432593380603974.post-39283729968659001092012-06-20T22:35:59.262-07:002012-06-20T22:35:59.262-07:00Miguel, code is already shared and the link is in ...Miguel, code is already shared and the link is in part 1 of this article. Enjoy!Ashokahttps://www.blogger.com/profile/04703466415906876075noreply@blogger.comtag:blogger.com,1999:blog-1756432593380603974.post-53771164886885495472012-06-20T07:43:01.033-07:002012-06-20T07:43:01.033-07:00Could you share the code? I'm learning about t...Could you share the code? I'm learning about the techniques used by programmers Wars Planet and I would like to test your botMiguel Angel Perez Medinahttps://www.blogger.com/profile/15947067316662506417noreply@blogger.comtag:blogger.com,1999:blog-1756432593380603974.post-91161173484579343122011-07-25T17:57:32.035-07:002011-07-25T17:57:32.035-07:00#Ashoka, Thanks for your response.
I'm more i...#Ashoka, Thanks for your response.<br /><br />I'm more into programming, than mathematic either. This formula comes from more pattern analysis than anything else. I made a algorithm for it about 2 years ago, but just found how to write it in a mathematical formula recently.<br /><br />I will need some help to prove it mathematically also. What I discovered is acctualy simple.<br />1 - Each disc makes a power of 2 moves;<br />2 - The increase in the number of moves for each additional disc and peg is related to the Pascal's Triangle, or better, combination.<br />3 - Each column of the Pascal's Triangle represents the number of pegs. The column 0 stands for 3 pegs, column 1 for 4 pegs, and so on... (col = pegs-3)<br />4 - Each row represents a group of discs that have the same number of moves. The first group (group 0) makes 2^0 moves, the second group (group 1) makes 2^1 moves, and so on...<br />5 - The result of the combination C(col,row) is the exact ammount of discs on that group.<br />6 - The relation between the group number and the row number is (pegs-3). So, for 3 pegs, group 0 is on row 0 (3-3), for 4 pegs, group 0 is on row 1 (4-3), and so on...<br />7 - The combination in factor of groups (n) and pegs (p), C(row,col) = C(n+p-3, p-3).<br /><br />After I found all this relations, I could make an algorithm and later a mathematical formula. But I still need help with the mathematical proof, or a proof that it is wrong.<br />I'm looking for help, also to write the inequation to find n as a function.<br /><br />Now I'm trying to find the number of optimal solutions for a given number of pegs and discs. This is all just for fun...<br /><br />Thanks for your interest! And I'll let you know if I make any progress.sublinhadohttps://www.blogger.com/profile/01722515518450835421noreply@blogger.comtag:blogger.com,1999:blog-1756432593380603974.post-35492839421573088492011-07-25T03:57:52.341-07:002011-07-25T03:57:52.341-07:00#sublinhado, Thanks for visiting and the comment!
...#sublinhado, Thanks for visiting and the comment!<br /><br />Your research seems very interesting and I wish you all the best.<br /><br />If your formula and the proof is indeed correct, that would be of some achievement! AFAIK a mathematical formula for the general case of n towers and m disks is still not available. (unless you cracked it) <br /><br />What they have at the moment is a conjecture. They have a set of numbers for the steps needed for each m and n and those seems to be the optimal values as well. I tested those numbers with my algorithm and i'm getting the same results too. However, no one has so far proved that those are indeed the best case numbers and there is no better answers.... <br /><br />you can run the program for the 4 tower case and see the results. <br /><br />I will have a detailed look at your studies and give you inputs if I have any, however my main interest in programming and AI but I'm not too much into mathematics. (I was, at one time but no longer have the time) <br /><br />Once again, thanks and all the best!Ashokahttps://www.blogger.com/profile/04703466415906876075noreply@blogger.comtag:blogger.com,1999:blog-1756432593380603974.post-23639941106006857932011-07-14T00:09:16.833-07:002011-07-14T00:09:16.833-07:00Hi, I'm a Computer Scientist and since my AI c...Hi, I'm a Computer Scientist and since my AI class I've been playing with optimizations for Hanoi Tower and multi-pegs tower...<br /><br />I've trying to create a general formula to find the optimal number of steps as a function of number of towers and number of rings. I got to this: http://en.wikipedia.org/wiki/Talk:Tower_of_Hanoi#Mnimal_number_of_moves_for_any_number_of_pegs_and_discs<br /><br />I didn't got time to test it very well or to explain how I got to it, but I'd like to share that and see if you are interested in testing it validity.sublinhadohttps://www.blogger.com/profile/01722515518450835421noreply@blogger.com