C++ Algorithm optimization / re-working

STAGE 1: Download program and evaluate C++ code and structure [login to view URL] In the link you will find directions to download the program (READ THE README FILE) and an article discussing the program. Please carefully read the article and it's associated references. (ATTACHED) I quote: "Splits greatly complicate analysis of the game; there are many challenges with even specifying a strategy involving splits, let alone evaluating or optimizing such a strategy. For example, should the player be allowed to consider all cards among all split hands in a round when making decisions, or just the cards in the current (possibly split) hand? The former would be optimal..." I want you to make sure the algorithm used in the program is indeed the best possible to consider ALL possibilities PRE splitting to calculate player expected values exactly and precisely. The Author of the program calls this :"CDP, where post-split strategy is allowed to vary as a function of the number of additional pair cards removed." He actually states that in the Blackjack game ([login to view URL]) he uses CDZ: "More precisely, in all cases, the strategy is CDZ-,where the optimal strategy for non-split hands is applied to post-split hands as well." So the CDP algorithm is probably only used in the other program [login to view URL] This will need investigating. Once this is applied to the [login to view URL] we will run a simulation to test the results which are suppose to improve using CDP. STAGE 2: Once this is proven we will consider optimizing the algorithm further using methods mentioned in this paper: [login to view URL] Please investigate the content of the research before applying any changes to the program. Finally we will run another simulation to confirm improvements in the results (EV and profitability)