Greedy Algorithm

Draw 2 cards.

"A greedy algorithm is any algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage. In many problems, a greedy
strategy does not usually produce an optimal solution,
but nonetheless, a greedy heuristic may yield locally
optimal solutions that approximate a globally optimal solution in a reasonable amount of time."