This commit replaces the incorrect greedy auto-tap heuristic with an algorithm to solve for the size of the maximum bipartite matching set, where the bipartite graph is composed of the mana pips of the goal card and the land cards in hand.
Adds a test case for the counterexample proposed in #16
This commit replaces the incorrect greedy auto-tap heuristic with an algorithm to solve for the size of the maximum bipartite matching set, where the bipartite graph is composed of the mana pips of the goal card and the land cards in hand.
Adds a test case for the counterexample proposed in #16
Closes #16