machine-learning-blackjack-solution

# machine-learning-blackjack-solution
 
## Introduction
A *genetic algorithm* is a type of artificial intelligence programming that uses ideas from evolution to solve complex problems.

It works by creating a population of (initially random) candidate solutions, then repeatedly selecting pairs of candidates and combining their solutions using a process similar to genetic crossover.  Sometimes candidate solutions even go through mutation, just to introduce new possibilities into the population.  

After a large number of generations, the best solution found up to that point is often the optimal, best solution possible.

Genetic algorithms are particularly well-suited for combinatorial problems, where there are huge numbers of potential solutions to a problem.  The evolutionary process they go through is, in essence, a search through a huge solution space.  A solution space so large that you simply could never use a brute force approach.

This project is a demonstration of using a geneti