I made a simple bot (Bot A)
card abstraction: 169-5000-5000-5000
algorithm: PCFR
clustering: k-means
type: distribution aware (50 bins), on river OCHS
iterations: 2.081 billions
Then I changed it's flop abstraction from 5000 to 10000 clusters. (Bot B), and matched it against Bot A.
1 000 000 hands, same rng seed. Here is the result.
Code:
iterations (billions)| result (mbb/hand) |
+--------------------+---------------------+
| 1.538 | -12.4895 |
+--------------------+---------------------+
| 2.536 | -3.8870 |
+--------------------+---------------------+
| 3.129 | -2.6320 |
+--------------------+---------------------+
| 3.402 | -2.8180 |
+--------------------+---------------------+
| 3.715 | -5.1305 |
+--------------------+---------------------+
I expected, that Bot B needs more iterations to converge, but after 3.129 billion iterations it results start to drop, and it never beats Bot A. I have to add, that i run the flop clustering in both case (5000 and 10000 clusters) only one time. I used k-means++ initialization which has a certain luck factor. It could explain, the poor result (because bad clustering), but not the decreasing tendency.
Have you ever experimented something like this?