Skip to content

Latest commit

 

History

History
59 lines (44 loc) · 3.01 KB

README.md

File metadata and controls

59 lines (44 loc) · 3.01 KB

Decoding the Deck: Leveraging Computer Simulations to Optimize Blackjack Profitability 🃏

Analysis of Blackjack Simulation to determine the optimal play strategies. Contain a written report, code, and data.

📊 Result:

After thousands of rounds and testing various strategies, I found that the best way to beat the game is quit when ahead or never start in the first place. The house always win in the end. The system is design as such.

📑 Abstract

Blackjack is a game card game enjoyed by many throughout the century. Though old, some strategy to beat the house/dealer have only recently emerged thanks to invents of computer. Blackjack game methods such as double down and card counting along with statistic are use in combination to determine the best strategy that would maximize the player’s profit. Multiples variation of strategies are simulated, and the average of the return is determined for the most profit.

General Game Play Flowchart

🗃️ Strategies and Simulation Visualization

Strategy #1: You Hella Basic [Universal Basic Strategy]

Strategy #2: Uno Reserve [Mirror Dealer Strategy]

Strategy #3: Double Trouble [Basic Strategy with Double Down Strategy]

Strategy #4: You Move You Lose - [Draw Until => 10 Strategy]

Strategy #5: Go Big or Go Home [Double Down Under 12 otherwise Stay Strategy]

Strategy #6: 1+1=-100 [10 Count - Card Counting Strategy]