bradleyT -


your example is pretty funny. i might remind you that "player_one == tight" and "player_two == fish" is a Hard Problem, capital H, capital P. ask the guys at the university of alberta what they think of opponent modeling.


for instance, i might remind you that the set of tight players and the set of fish have a non-empty intersection.


i think i'll go write down some pseudocode for the "solving all my problems" problem and use it to solve all my problems now.


good luck


the club