Quote:
Originally Posted by PissedOffLoser
1. Is GTO actually possible to achieve?
The answer is a shocking 'no'. Reaching GTO is like running after infinity and catching it, you CAN'T, it's a THEORETICAL term stating something that exists on paper but will never actually happen
Your statement is provably false. It is true only in the sense that the methods that are typically used to approach problems of the size/complexity of texas holdem have the property you mention - they try to converge on the solution but may never find it.
But given that the solution exists and the solution space is finite, it is guaranteed that if you look long enough, you will find the optimal solution. It may not be *practical* to do so but it is definitely *possible*. i.e. it might take a trillion years of all the computing power in the universe.
But you also might get lucky and find it much sooner. Anyway, it's not *impossible* to find it, just not that likely.
Also, I do think it's much much easier to find "nearly optimal" solutions. A typical example of a non-polynominal problem is the travelling salesman problem. With more than a handful of cities the problem is intractible to solve by brute force but there are a number of simplifying steps that can be taken to give a nearly optimal solution (to within, say, .00001% of optimal) that can be computer with no real difficulty.
But that also doesn't mean that anyone has arrived at a near optimal solution, nor that snowie in particular has.