[ QUOTE ]
You haven't a clue what's Nash equilibrium for hold'em. No one knows it.
[/ QUOTE ]
This is something that can be solved by computational game theory (at least within some epsilon). However, computational resources are not at the stage yet in which the game of heads-up limit hold'em can be solved (a game with about 10^18 states). However, the most recent work in this area has solved an abstraction of the game with 10^12 states and then uses the solutions from that game as approximate solutions to the full-scale game.
Regret Minimization in Games with Incomplete Information
Check out the work done by the
University of Alberta Computer Poker Research Group. I just started my Master's there in Computer Science. Their most recent pseudo-optimal heads-up bots are playable at Poker Academy and recently competed against Phil Laak and Ali Eslami in a Man-Machine competition.