Drop 8 and 9 card testing cases

Author: HenryRLee

python/tests/table_tests/test_dptables.py

@@ -12,15 +12,7 @@
 
 
 class TestSuitsTable(unittest.TestCase):
-    DP: ClassVar[list[int]] = [0] * len(SUITS)
-
-    @classmethod
-    def setUpClass(cls) -> None:
-        for k in [5, 6, 7, 8, 9]:
-            cls.update_k(cls.DP, k)
-
-    @staticmethod
-    def update_k(table: list[int], k: int) -> None:
+    def check_suit_table_by_k(self, k: int) -> None:
         iterable = list(range(k + 1))
         combs = combinations_with_replacement(iterable, 3)
 
@@ -33,19 +25,11 @@ def update_k(table: list[int], k: int) -> None:
                         0x1 * cnts[0] + 0x8 * cnts[1] + 0x40 * cnts[2] + 0x200 * cnts[3]
                     )
 
-                    # TODO(@ohwi): Check these cases:
-                    # https://github.com/HenryRLee/PokerHandEvaluator/issues/93
-                    #   There exist three cases that idxes are same.
-                    #   For two different cnts in case of k=9.
-                    #   The cases are 72, 520, 576.
-                    if idx in [72, 520, 576] and SUITS[idx] != suit + 1:
-                        continue
-
-                    table[idx] = suit + 1
+                    self.assertEqual(SUITS[idx], suit + 1)
 
     def test_suits_table(self) -> None:
-        self.assertListEqual(self.DP, SUITS)
-
+        for k in [5, 6, 7]:
+            self.check_suit_table_by_k(k)
 
 class TestChooseTable(unittest.TestCase):
     DP: ClassVar[list[list[int]]] = [