{{
`${userDetail.user.displayName}${userDetail.user.cachedBungieGlobalDisplayNameCode ? `#${standardizeBungieGlobalCode(userDetail.user.cachedBungieGlobalDisplayNameCode)}` : ""}`}}
{{getUserClans()}}
12/16/2013 2:52:56 AM
3
Ok - was going to try to ramble my way through an attempt but it's becoming very complex very quickly. Mind clearing up the problem a bit. What is your ultimate goal and perhaps there is an easier way to arrive at a solution. I know this is probably a bit late for implementing the extra credit but willing to give it a shot if you've still got time.
English
-
One way that it might somewhat be explained is the following: You start the hand with 1 card that is a free card the probability that the next card matches it is 3/51 and the probability that you otherwise end up with D = 2 is 48/51. The 3rd card can be treated the same way but in 2 branches assuming D = 2 what's your new probabilities - D = 3 = 45/50 and assuming C was 1 before you now have a 1/25 that B becomes 1 and 24/25 that C stays 1 and D becomes 1 - you will multiply the probabilities at each stage to find the respective probabilities of each possibility but I would hate to do it by typing out an explanation here for anything >3.
-
Sorry about not responding earlier. Between Networking and Technical Interviews my weekend has been horifically busy. [url=http://www.bungie.net/en/Forum/Post?id=63018001&path=1]This was the ultimate[/url] goal, my solution borrowed from the wikipedia list of poker hands page, it looked something like that, though it occurs to me that I didn't go for a recursive solution so perhaps my function is poorly named >_>
-
No problem, figured it was some issue with the card game AI but wasn't sure if there was an alternative method to achieving the same functionality. Not sure if the posted code achieves the same results as my attempt (just briefly scanned the functions) but don't imagine it makes much of a difference at this point.
