Re:Ice cold decks (dealer wins no matter how the deck is cut)
by johnwatson11218 on Wednesday February 17, 2010 @08:26PM
(#1133164)
Didn't see it in the article but it might be nice to see the total number of solutions as n increases. This might be a good application for genetic algorithms to search this large space.
[ Parent
| on HN ]
Re:Ice cold decks (dealer wins no matter how the deck is cut)
by leif on Wednesday February 17, 2010 @09:33PM
(#1133254)
I'm interested in this function as well. I'd like to try to analyze his script to see if there is such a bound, or at least some theoretical results to be pulled out of it, but I didn't see the guy's script on the page; has anyone found it?
Re:Ice cold decks (dealer wins no matter how the deck is cut)
by jonp on Thursday February 18, 2010 @05:35AM
(#1133857)
The page http://www.benjoffe.com/holdem_files/heuristic.html is running the two-player case. It seems to be using a Javascript hill-climbing algorithm: pick a scoring function which measures how good the solution is, then start from a random deck and try small changes, keeping them only if the score improves.