Create a program capable of solving (finding the nash equilibrium of) specific games

The program is required to find the Nash equilibrium of the following game. Before I explain the game I would like to highlight that the game itself is rather simple and has a relatively small size game tree ([login to view URL]). All the game theory is very simple and I am happy to answer any questions about it, the chief concern is whether you are able to program a solution for the game, not understand it (as I am sure I will be able to clarify anything left unclear after my explanation). The game is a simple version of no-limit texas holdem poker. There are 2 players, P1 and P2. Each player has a stack of X, from which they can bet and call with. Each player has, not a specific hand such as {AhAc}, but a probability associated with many hands such as {(25%, AhAc), (25%, KdJd), (50%, 2d2c)} The pot is size Y. 4 "community" cards have been dealt. That is we are considering a subgame which begins on "the turn". For example the board may be {Kh7h2c Qd} Player 1 acts first, having the option to check or bet some amount **One might want to restrict the possible bet sizes P1 can make, as in "real poker" he is able to be any amount between [0,X], but limiting him to betting (X/3, X/2, X) may be analytically simpler and a reasonable approximation** Player 2 then acts, having the option to check (if P1 also checked)/ call (if P1 bet)/ raise to an amount (if P1 bet)... If player 1 is facing a bet (this is because he checked and P2 bet, or he bet and P2 raised) he has the option to fold/call/ or re raise all in. . . After the betting is finished for this round. Another card is dealt, "the river". Then a final betting round begins with P1 acting first. The pot is awarded to the player with the best poker hand or if someone folded, it is awarded to the player who didn't fold.