Thank you. This comment saved me a lot of time!

this is what I did, but I used Math.pow because I'm used to it

HALT is typically considered a separate state. I think you should explicitly mention that kata does not consider it as a separate state. Because techinally, the 1 state machines you provided as an example are acctually 2 state machines: 1 "actual" state and HALT.

Python: description must be language specific. BigInt is not python-specific and needs to be replaced with just int

There's an inconsistency in terms you use. In the title it's length, in description it's number of rules. I suggest you change the title to "Count number of Turing Machines with N rules". There's no such thing as a turing machine program, it only has rules.

Updated.

The color of the heading "Example" and the "p.s" at the end makes it hard to read in light mode.

.

Python translation.

JS fork

• Node 18+
• chai assertions
• using modern JavaScript classes in description and tests
• backwards-compatible with old solutions

There’s something oddly comforting about reading the comments and seeing others struggled too — like, “Okay, it wasn’t just me.” It feels like we were all in the same boat… and somehow, you still managed to solve it. That moment? Pure satisfaction.

Glad to know you enjoyed it that much!

Honestly, when I finally solved this… I was surprised!
It was such a weird and creative approach — and it totally caught me off guard.

But that’s exactly what made this kata awesome.
It helped me see classes from a totally different perspective, like switching to a new viewport!

Thank you so much for putting in the effort to design something this clever.
Katas like this are the reason I keep coming back to Codewars.
Keep 'em coming!

The tests should necessarily include numbers from 100. Without that you can complete it and earn honor even with an incorrect solution