1 / 15

Can ADP Bring Down The House? 6.231 Project Presentation December 14, 2012

Can ADP Bring Down The House? 6.231 Project Presentation December 14, 2012. By . Cristian Figueroa. Outline. Introduction Blackjack Analysis Model S-ALP Results Conclusion. Project Objective.

imala
Télécharger la présentation

Can ADP Bring Down The House? 6.231 Project Presentation December 14, 2012

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Can ADP Bring Down The House?6.231 Project PresentationDecember 14, 2012 By. Cristian Figueroa

  2. Outline • Introduction • Blackjack • Analysis • Model • S-ALP • Results • Conclusion

  3. Project Objective • Analyze the effect of using ADP to obtain a “winning” policy to the popular casino game: Blackjack

  4. Blackjack Rules • The dealer deals 2 cards to each player. • Player then: • Hits: Receives and additional card • Stands: Finishes his turn. • Double Down: Raises bet 100%, hits and stands. • Surrender: Give up, receive 50% of the bet back. • Dealer adds cards as necessary until her score reaches 17 or more. • The player with the score closest to 21, but not over 21, wins.

  5. Blackjack Example

  6. Blackjack Flowchart Player Dealer Stand > 16 Player Busted Hit Payoff Hit Dealer Turn Deal Player Bets Double Down Stand Surrender

  7. Modeling Challenges • Two main challenges when modeling this game: • Decisions depend on previous actions. • How much to bet is decided before seeing the cards. • The number plays that a game last is a random variable. • Consequences: • Hard to obtain and define a stationary policy. • Discounted schemes may have unexpected outcomes.

  8. Blackjack Model Player: First Action Post Game (if applies) Dealer Plays Hit S > 16 Stand H Payoff Busted Next bet DD Stand Hit Su Deal

  9. Blackjack model • States: • Controls • Costs

  10. Smoothed Approximate Linear Program • To solve the Bellman Equation: • Approximate Linear Program suggest solving: • The Smoothed Approximate Linear Program:

  11. Implementation Update q Generate States Through Simulation Sample States Create Constraints Solve S-ALP Simulate Policy <10 seconds Hours Hours Miliseconds <10 seconds

  12. Performance: 1000 Hands

  13. 100 Games of 1000 Hands S-ALP Policy: 11.5 Wikipedia Strategy: -11.355

  14. Conclusions • High variability in the outcomes require a large number of simulations in order to get reliable results. • Even though the model works correctly, in games where stages are semi independent one-step look ahead, or rollout probably work better. • Checking your policy with common sense helps for realizing flaws in the model. • The choice of basis functions is just as important as obtaining accurate values.

  15. Blackjack model • States: • Controls • Costs

More Related